Leonard M. Adleman
Author's Web Page
8 papers in database with 7829 citations  H-number: 5
Journal Papers
[Sort papers chronologically] [Sort papers by citations count]
1. Ronald L. Rivest,  Adi Shamir,  Leonard M. Adleman,  A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Volume 21(2), pp. 120 - 126, Association for Computing Machinery, 1978. [Cited 7536 times ]
Conference Papers
[Sort papers chronologically] [Sort papers by citations count]
1. Leonard M. Adleman,  Jonathan DeMarrais,  A Subexponential Algorithm for Discrete Logarithms over All Finite Fields, pp. 147 - 158, CRYPTO 1993. [Electronic Edition][Cited 113 times ]
2. Kireeti Kompella,  Leonard M. Adleman,  Fast Checkers for Cryptography, pp. 515 - 529, CRYPTO 1990. [Electronic Edition][Cited 5 times ]
3. Leonard M. Adleman,  An Abstract Theory of Computer Viruses, pp. 354 - 374, CRYPTO 1988. [Electronic Edition][Cited 107 times ]
4. Dennis Estes,  Leonard M. Adleman,  Kireeti Kompella,  Kevin S. McCurley,  Gary L. Miller,  Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields, pp. 3 - 13, CRYPTO 1985. [Electronic Edition][Cited 17 times ]
5. Leonard M. Adleman,  On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem, pp. 303 - 308, CRYPTO 1982. [Electronic Edition][Cited 48 times ]
6. Leonard M. Adleman,  Implementing an Electronic Notary Public, pp. 259 - 265, CRYPTO 1982. [Electronic Edition][Cited 3 times ]
7. Leonard M. Adleman,  Primality Testing, pp. 10 - 10, CRYPTO 1981. [Electronic Edition][No citation]

Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals