Secure user identification based on constrained polynomials J Hoffstein, BS Kaliski Jr, DB Lieman, MJB Robshaw, YL Yin US Patent 6,076,163, 2000 | 316 | 2000 |
On the statistical properties of Diffie-Hellman distributions R Canetti, J Friedlander, S Konyagin, M Larsen, D Lieman, I Shparlinski Israel Journal of Mathematics 120, 23-46, 2000 | 111 | 2000 |
An effective zero-free region D Goldfeld, J Hoffstein, D Lieman Annals of Mathematics 140 (1), 177-181, 1994 | 89 | 1994 |
NTRU: A public key cryptosystem J Hoffstein, D Lieman, J Pipher, JH Silverman NTRU Cryptosystems, Inc.(www. ntru. com), 1999 | 61 | 1999 |
Double Dirichlet series and the n-th order twists of Hecke L-series S Friedberg, J Hoffstein, D Lieman Mathematische Annalen 327, 315-338, 2003 | 48 | 2003 |
On the distribution of the RSA generator JB Friedlander, D Lieman, IE Shparlinski Sequences and their Applications: Proceedings of SETA’98, 205-212, 1999 | 38 | 1999 |
Nonvanishing of L-series associated to cubic twists of elliptic curves DB Lieman Annals of Mathematics 140 (1), 81-108, 1994 | 36 | 1994 |
The distribution of the quadratic symbol in function fields and a faster mathematical stream cipher J Hoffstein, D Lieman Cryptography and Computational Number Theory, 59-68, 2001 | 33 | 2001 |
Secure user identification based on ring homomorphisms J Hoffstein, JH Silverman, D Lieman US Patent 6,959,085, 2005 | 19 | 2005 |
Whittaker–Fourier coefficients of metaplectic Eisenstein series W Banks, D Bump, D Lieman Compositio Mathematica 135 (2), 153-178, 2003 | 19 | 2003 |
On The Correlation Of Binary M-sequences J Friedlander, M Larsen, D Lieman, I Shparlinski Designs, Codes and Cryptography 16, 249-256, 1999 | 16 | 1999 |
Effective bounds on the size of the Tate-Shafarevich group D Goldfeld, D Lieman Mathematical Research Letters 3, 309-318, 1996 | 15 | 1996 |
A public key cryptosystem based on sparse polynomials D Grant, K Krastev, D Lieman, I Shparlinski Coding Theory, Cryptography and Related Areas: Proceedings of an …, 2000 | 14 | 2000 |
Non-linear complexity of the Naor–Reingold pseudo-random function WD Banks, F Griffin, D Lieman, IE Shparlinski Information Security and Cryptology-ICISC’99: Second International …, 2000 | 14 | 2000 |
Average values of cubic L-series D Farmer, J Hoffstein, D Lieman PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS 66 (2), 27-34, 1999 | 13 | 1999 |
The Rankin-Selberg convolution for functions not of rapid decay DB Lieman | 12 | 1993 |
On a new exponential sum D Lieman, I Shparlinski Canadian Mathematical Bulletin 44 (1), 87-92, 2001 | 11 | 2001 |
NTRU: a public key cryptosystem. NTRU Cryptosystems J Hoffstein, D Lieman, J Pipher, JH Silverman Inc.(www. ntru. com), 1999 | 10 | 1999 |
Cryptographic applications of sparse polynomials over finite rings WD Banks, D Lieman, IE Shparlinski, T Van To International Conference on Information Security and Cryptology, 206-220, 2000 | 8 | 2000 |
An identification scheme based on sparse polynomials WD Banks, D Lieman, IE Shparlinski International Workshop on Public Key Cryptography, 68-74, 2000 | 8 | 2000 |