Justin M. Reyneri

According to our database, Justin M. Reyneri authored at least 7 papers between 1981 and 1984.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1984

Coin flipping by telephone.

Justin M. Reyneri, Ehud D. Karnin

IEEE Trans. Inf. Theory, 1984

1983

On the necessity of cryptanalytic exhaustive search.

Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri

SIGACT News, 1983

Compact knapsacks are polynomially solvable.

Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri

SIGACT News, 1983

1982

Drainage and the DES.

Martin E. Hellman, Justin M. Reyneri

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

Fast Computation of Discrete Logarithms in GF(q).

Martin E. Hellman, Justin M. Reyneri

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981

On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis.

Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri

Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

A Polynomial Time Solution for Compact Knapsacks.

Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri

Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981