Searching for authors named Daniel Lieman – sorted by Relevance.
-
On A New Exponential Sum
- ON A NEW EXPONENTIAL SUM Daniel Lieman Department of Mathematics University of Missouri
- Cited by 1 (0 self) – Add To MetaCart
-
On The Distribution Of The RSA Generator
- ON THE DISTRIBUTION OF THE RSA GENERATOR John Friedlander, Daniel Lieman y and Igor
- Cited by 11 (8 self) – Add To MetaCart
-
A Public Key Cryptosystem Based On Sparse Polynomials
- A PUBLIC KEY CRYPTOSYSTEM BASED ON SPARSE POLYNOMIALS David Grant Daniel Lieman y Igor
- Cited by 4 (2 self) – Add To MetaCart
-
Polynomial Rings and Efficient Public Key Authentication
- Polynomial Rings and Efficient Public Key Authentication Jeffrey Hoffstein, Daniel Lieman
- Cited by 9 (5 self) – Add To MetaCart
-
An Extremely Small And Efficient Identification Scheme
- AN EXTREMELY SMALL AND EFFICIENT IDENTIFICATION SCHEME William D. Banks 1 , Daniel Lieman 2
- Add To MetaCart
-
On the statistical properties of Diffie-Hellman distributions
- † Sergei Konyagin ‡ Michael Larsen § Daniel Lieman ¶ Igor Shparlinski � August 16, 2002 Abstract Let p be a
- Cited by 18 (10 self) – Add To MetaCart
-
On the linear complexity of the Naor-- Reingold pseudo-random function
- Griffin 2 , Daniel Lieman 3 , Igor E. Shparlinski 4 1 Department of Mathematics, University of Missouri
- Cited by 7 (5 self) – Add To MetaCart
-
An identification scheme based on sparse polynomials
- AN IDENTIFICATION SCHEME BASED ON SPARSE POLYNOMIALS William D. Banks 1 , Daniel Lieman 2 and Igor
- Cited by 2 (1 self) – Add To MetaCart
-
On The Correlation Of Binary M-Sequences
- ON THE CORRELATION OF BINARY M-SEQUENCES John Friedlander # Michael Larsen + Daniel Lieman
- Cited by 4 (4 self) – Add To MetaCart
-
Thuong To, \Cryptographic Applications of Sparse Polynomials over Finite Rings
- CRYPTOGRAPHIC APPLICATIONS OF SPARSE POLYNOMIALS OVER FINITE RINGS William D. Banks 1 , Daniel
- Cited by 1 (0 self) – Add To MetaCart

