Daniel Lieman

According to our database, Daniel Lieman authored at least 6 papers between 1998 and 2000.

Collaborative distances:

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

2000

An Identification Scheme Based on Sparse Polynomials.

William D. Banks, Daniel Lieman, Igor E. Shparlinski

Proceedings of the Public Key Cryptography, 2000

Cryptographic Applications of Sparse Polynomials over Finite Rings.

William D. Banks, Daniel Lieman, Igor E. Shparlinski, Van Thuong To

Proceedings of the Information Security and Cryptology, 2000

An Extremely Small and Efficient Identification Scheme.

William D. Banks, Daniel Lieman, Igor E. Shparlinski

Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000

1999

On The Correlation of Binary Sequences.

John B. Friedlander, Michael Larsen, Daniel Lieman, Igor E. Shparlinski

Des. Codes Cryptogr., 1999

Non-linear Complexity of the Naor-Reingold Pseudo-random Function.

William D. Banks, Frances Griffin, Daniel Lieman, Igor E. Shparlinski

Proceedings of the Information Security and Cryptology, 1999

1998

On the Distribution of the RSA Generator.

John B. Friedlander, Daniel Lieman, Igor E. Shparlinski

Proceedings of the Sequences and their Applications, 1998