Abstract
Since its inception in the mid 1970’s, public-key cryptography has flourished as a research activity, and significant theoretical advances have been made. In more recent years, many public-key concepts have gained acceptance in the commercial world. Without question, the best-known public-key cryptosystem is the RSA system of Rivest, Shamir and Adleman [28]. Although not as well-known, another public-key cryptosystem of practical interest is that due to ElGamal [11]. The latter system and its variations use a basic extension of Diffie-Hellman key exchange [9] for encryption, together with an accompanying signature scheme. Elliptic curve cryptosystems, introduced by Miller [24] and Koblitz [12], have also recently received much attention as cryptographic alternatives.
Partial support for this work was provided by the University of Waterloo, Waterloo, Ontario, and by Newbridge Microsystems, Kanata, Ontario.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Bach, “Intractable problems in number theory”, Advances in Cryptology-Crypto 88, S. Goldwasser (ed), Lecture Notes in Computer Science 403, Springer-Verlag (1990), 77–93.
A. Bender and G. Castagnoli, “On the implementation of elliptic curve cryptosystems”, Advances in Cryptology-Crypto 89, G. Brassard (ed.), Lecture Notes in Computer Science 435, Springer-Verlag (1990), 186–192.
I.F. Blake, R. Fuji-Hara, R.C. Mullin, and S.A. Vanstone, “Computing logarithms in finite fields of characteristic two”, SIAM J. Alg. Disc. Meth. 5(2), June 1984, 276–285.
E.F. Brickell, “A survey of hardware implementations of RSA (abstract)”, Advances in Cryptology-Crypto 89, G. Brassard (ed.), Lecture Notes in Computer Science 435, Springer-Verlag (1990), 368–370.
T.T. Caron and R.D. Silverman, “Parallel Implementation of the quadratic sieve”, J. Supercomput. 1 (1988), 273–290.
D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two”, IEEE Transactions on Information Theory IT-30(4), July 1984, 587–594.
D. Coppersmith, A.M. Odlyzko, and R. Schroeppel, “Discrete logarithms in GF(p)”, Algorithmica 1(1), 1986,1–15.
J.A. Davis, D.B. Holdridge, and G.J. Simmons, “Status report on factoring”, Advances in Cryptology-Eurocrypt 84, T. Beth, N. Cot, I. Ingemarsson (eds.), Lecture Notes in Computer Science 209, Springer-Verlag (1985), 183–215.
W. Diffie and M. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory IT-22(6), Nov. 1976,644–654.
S.R. Dusse and B.S. Kaliski, Jr., “A cryptographic library for the Motorola DSP56000”, Advances in Cryptology-Eurocrypt 90, I. Damgard (ed.), to appear.
T. EIGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory IT-31(4), July 1985, 469–472.
N. Koblitz, “Elliptic curve cryptosystems”, Math. Comp. 48 (1987), 203–209.
N. Koblitz, “Constructing elliptic curve cryptosystems in characteristic 2”, Advances in Cryptology-Crypto 90, S.A. Vanstone (ed.), to appear.
B.A. LaMacchia and A.M. Odlyzko, “Solving large sparse linear systems over finite fields”, Advances in Cryptology-Crypto 90, S.A. Vanstone (ed.), to appear.
B.A. LaMacchia and A.M. Odlyzko, “Computation of discrete logarithms in prime fields”, Advances in Cryptology-Crypto 90, S.A. Vanstone (ed.), to appear.
A.K. Lenstra and H.W. Lenstra, Jr., “Algorithms in number theory”, in Handbook of theoretical computer science, A. Meyer, M. Nivat, M. Paterson, D. Perrin (eds.), North Holland, Amsterdam, to appear.
A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse and J.M. Pollard, “The number field sieve”, Proc. 22 nd ACM Symp. Theory of Computing (1990), 564–572.
A.K. Lenstra and M.S. Manasse, “Factoring by electronic mail”, Advances in Cryptology-Eurocrypt89, J.-J. Quisquater and J. Vandewalle (eds.), Lecture Notes in Computer Science 434, Springer-Verlag (1990), 355–371.
A.K. Lenstra and M.S. Manasse, “Factoring with two large primes”, Advances in Cryptology-Eurocrypt 90, I. Damgard (ed.), to appear.
H.W. Lenstra, Jr., “Factoring with elliptic curves”, Ann. of Math. 126 (1987), 649–673.
K.S. McCurley, “The discrete logarithm problem”, in Cryptography and Computational Number Theory, C. Pomerance (ed.), Proc. Symp. Appl. Math., Amer. Math. Soc. (1990), to appear.
A. Menezes and S. Vanstone, “The implementation of elliptic curve cryptosystems”, Advances in Cryptology-Auscrypt 90, J. Seberry and J. Pieprzyk (eds.), Lecture Notes in Computer Science 453, Springer-Verlag (1990), 2–13.
A. Menezes, S. Vanstone and T. Okamoto, “Reducing elliptic curve logarithms to logarithms in a finite field”, presented at Crypto 90; to appear in Proc. 23rd ACM Symp. Theory of Computing (1991)
V. Miller, “Uses of elliptic curves in cryptography”, Advances in Cryptology-Crypto 85, H. Williams (ed.), Lecture Notes in Computer Science 218, Springer-Verlag (1986), 417–426.
A.M. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance”, Advances in Cryptology-Eurocrypt 84, T. Beth, N. Cot, I. Ingemarsson (eds.), Lecture Notes in Computer Science 209, Springer-Verlag (1985), 224–314.
C. Pomerance, “Analysis and comparison of some integer factoring algorithms”, in Computational Methods in Number Theory, H.W. Lenstra, Jr. and R. Tijdeman (eds.), Math. Centrum Tract 154,1982, 89–139.
C. Pomerance, J.W. Smith and R. Tuler, “A pipeline architecture for factoring large integers with the quadratic sieve algorithm”, SIAM J. Computing 17(2), Apr. 1988, 387–403.
R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Communications of the ACM 21 (1978), 120–126.
T. Rosati, “A High Speed Data Encryption Processor for Public Key Cryptography”, Proceedings of the IEEE Custom Integrated Circuits Conference, May 1989.
C.P. Schnorr, “Efficient identification and signatures for smart cards”, Advances in Cryptology-Crypto 89, G. Brassard (ed.), Lecture Notes in Computer Science 435, Springer-Verlag (1990), 239–251.
M. Shand, P. Bertin and J. Vuillemin, “Hardware speedups in long integer multiplication”, Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, Crete, July 2–6,1990, to appear.
R.D. Silverman, “The multiple polynomial quadratic sieve”, Math. Comp. 48 (1987), 329–339.
G.J. Simmons (ed.), Contemporary Cryptology: The Science of Information Integrity, IEEE press, to appear.
D.H. Wiedemann, “Solving sparse linear equations over finite fields”, IEEE Transactions on Information Theory IT-32(1), Jan. 1986, 54–62.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Oorschot, P.C. (1991). A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive