A Survey of Public-Key Cryptosystems
Authors:
- Neal KoblitzNKNeal Koblitz
- Alfred J. MenezesAMAlfred J. Menezes
- 1 January 2004
- journal article
- review article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 46 (4) , 599-634
Abstract
We give an overview of the most important public-key cryptosystems and discuss the difficult task of evaluating the merit of such systems.Keywords
This publication has 102 references indexed in Scilit:
- Fast computation of canonical lifts of elliptic curves and its application to point countingFinite Fields and Their Applications, 2003
- Vigenère-Verschlüsselung: Theorie und PraxisMathematische Semesterberichte, 2000
- Public-key cryptosystems based on cubic finite field extensionsIEEE Transactions on Information Theory, 1999
- Discrete logarithms and local unitsPhilosophical Transactions A, 1993
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- Cryptanalysis of short RSA secret exponentsIEEE Transactions on Information Theory, 1990
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- A high security log-in procedureCommunications of the ACM, 1974