A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit â€“ as measured by the number of non-linearâ€¦ (More)

New techniques for reducing the depth of circuits for cryptographic applications are described. These techniques also keep the number of gates quite small. The result, when applied to the AES S-Box,â€¦ (More)

The intention in designing data structures with relaxed balance, such as chromatic search trees, is to facilitate fast updating on shared-memory asynchronous parallel architectures. To obtain this,â€¦ (More)

In this paper, efficient algorithms are given for inferring sequences produced by certain pseudo-random number generators. The generators considered are all of the formâ€¦ (More)

We investigate the problem of giving seat reservations on-line. We assume that a train travels from a start station to an end station, stopping at k stations, including the first and last.â€¦ (More)

We introduce a new concept called convertible undeniable signature schemes. In these schemes, release of a single bit string by the signer turns all of his signatures, which were originallyâ€¦ (More)

A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuitâ€”as measured by the number of nonlinear gatesâ€¦ (More)

23rd Annual Symposium on Foundations of Computerâ€¦

1982

Suppose it is known that {X<sub>0</sub>, X<sub>1</sub>,...,X<sub>n</sub>} is produced by a pseudo-random number generator of the form X<sub>i+1</sub> = aX<sub>i</sub> + b mod m, but a, b, and m areâ€¦ (More)