U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications by: Rene Peralta (Fed)

Search Title, Abstract, Conference, Citation, Keyword or Author
Displaying 51 - 75 of 83

Report on Pairing-based Cryptography

February 3, 2015
Author(s)
Dustin Moody, Rene C. Peralta, Ray A. Perlner, Andrew R. Regenscheid, Allen L. Roginsky, Lidong Chen
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST’s position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in

Four Measures of Nonlinearity

June 23, 2013
Author(s)
Joan Boyar, Magnus Find, Rene Peralta
Cryptographic applications, such as hashing, block ciphers and stream ciphers, make use of functions which are simple by some criteria (such as circuit implementations), yet hard to invert almost everywhere. A necessary condition for the latter property is

Secure Sealed-Bid Online Auctions Using Discreet Cryptographic Proofs

May 10, 2013
Author(s)
Rene C. Peralta, Jose A. Montenegro, Javier Lopez
This work describes the design and implementation of an auction system using secure multiparty computation techniques. Our aim is to produce a system that is practical under actual eld constraints on computation, mem- ory, and communication. The underlying

Logic Minimization Techniques with Applications to Cryptology

April 1, 2013
Author(s)
Joan Boyar, Philip Matthews, Rene Peralta
A new technique for combinational logic optimization is described. The technique is a two-step process. In the rst step, the non-linearity of a circuit as measured by the number of non-linear gates it contains is reduced. The second step reduces the number

A public randomness service

July 21, 2011
Author(s)
Michael J. Fischer, Michaela Iorga, Rene Peralta
We argue for the deployment of sources of randomness on the Internet for promoting and enhancing electronic commerce. We describe, in rough detail, our planned implementation of such a source.

A depth-16 circuit for the AES S-box

June 17, 2011
Author(s)
Joan Boyar, Rene Peralta
New techniques for reducing the depth of circuits for cryptographic applications are described and applied to the AES S-box. These techniques also keep the number of gates quite small. The result, when applied to the AES S-box, is a circuit with depth 16

Status Report on the Second Round of the SHA-3 Cryptographic Hash Algorithm Competition

February 23, 2011
Author(s)
Meltem Sonmez Turan, Ray A. Perlner, Lawrence E. Bassham, William E. Burr, Dong H. Chang, Shu-jen H. Chang, Morris J. Dworkin, John M. Kelsey, Souradyuti Paul, Rene C. Peralta
The National Institute of Standards and Technology (NIST) opened a public competition on November 2, 2007 to develop a new cryptographic hash algorithm - SHA-3, which will augment the hash algorithms currently specified in the Federal Information

Security Considerations for Remote Electronic UOCAVA Voting

February 21, 2011
Author(s)
Nelson Hastings, Rene Peralta, Stefan Popoveniuc, Andrew Regenscheid
This whitepaper for the Technical Guidelines Development Committee (TGDC) identifies desirable security properties of remote electronic voting systems, potential benefits and threats to these systems, and current and emerging technical approaches for

On the shortest linear straight-line program for computing linear forms

August 29, 2008
Author(s)
Joan Boyar, Philip Matthews, Rene Peralta
We study the complexity of the Shortest Linear Program (SLP) problem, which is to the number of linear operations necessary to compute a set of linear forms. SLP is shown to be NP-hard. Furthermore, a special case of the corresponding decision problem is

Tight Bounds for the Multiplicative Complexity of Symmetric Functions

April 28, 2008
Author(s)
Joan Boyar, Rene Peralta
The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f , when only exclusive-or, conjunction and negation gates may be used. This article