Search the dblp DataBase
Daniel Lieman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- William D. Banks, Daniel Lieman, Igor Shparlinski
An Extremely Small and Efficient Identification Scheme. [Citation Graph (0, 0)][DBLP]
ACISP, 2000, pp:378-384 [Conf] - William D. Banks, Frances Griffin, Daniel Lieman, Igor Shparlinski
Non-linear Complexity of the Naor-Reingold Pseudo-random Function. [Citation Graph (0, 0)][DBLP]
ICISC, 1999, pp:53-59 [Conf] - William D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To
Cryptographic Applications of Sparse Polynomials over Finite Rings. [Citation Graph (0, 0)][DBLP]
ICISC, 2000, pp:206-220 [Conf] - William D. Banks, Daniel Lieman, Igor Shparlinski
An Identification Scheme Based on Sparse Polynomials. [Citation Graph (0, 0)][DBLP]
Public Key Cryptography, 2000, pp:68-74 [Conf] - John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski
On The Correlation of Binary Sequences. [Citation Graph (0, 0)][DBLP]
Des. Codes Cryptography, 1999, v:16, n:3, pp:249-256 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002