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)

Displaying 76 - 83 of 83

Concrete Multiplicative Complexity of Symmetric Functions

August 1, 2006

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

Dark Encounter Computations (And Musings on Biological Networks)

August 1, 2006

Author(s)

Rene C. Peralta

We describe two models of distributed computation in which the agents are anonymous finite-state sensors interacting through a communication network whose dynamics (in case the agents are mobile) and/or topology they do not control or even know about

Cryptographic Primitives Can Be Fragile

January 3, 2006

Author(s)

Rene C. Peralta

We show that a well-known coin-flipping protocol is breakable in the sense that one of the parties can pre-determine the result of the coin-flip. The way in which the protocol fails is illustrative of the fact that there are insecure ways of using secure

The Exact Multiplicative Complexity of the Hamming Weight Function

September 13, 2005

Author(s)

Rene C. Peralta, Joan Boyar

We consider the problem of computing the Hamming weight of an n-bit vector using a circuit with gates for addition and multiplication modulo 2 (alternatively, XOR and conjunction gates) only. The number of multiplications necessary and sufficient to build