Abstract
A new signature scheme is proposed together with an implementation of the Diffie - Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
This work was supported by the NSF under contract ECS83 07741 while the author was at the information systems laboratory. Stanford University.
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
L. Adleman, A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography, Proc. 20th IEEE Foundations of Computer Science Symposium (1979). 55–50.
D. Coppersmith. Fast Evaluation of Logarithms in Fields of Characteristic two, IEEE Transactions on Information Theory IT-30 (1964), 587–594.
W. Diffie and M. Hellman. New Directions in Cryptography, IEEE Transactions on Information Theory, IT-22 (1976). 472–492.
T. ElGamal. A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2). submitted to IEEE Transactions on Information Theory.
A. Odlyzko. Discrete Logarithms in Finite Fields and Their Cryptographic Significance. to appear in Proceedings of Eurocrypt’ 84.
H. Ong and C. Schnorr, Signatures Through Approximate Representations by Quadratic Forms, to be published.
H. Ong, C. Schnorr, and A. Shamir, An efficient Signature Scheme Based on Quadratic Forms, pp 208–216 in Proceedings of 16th ACM Symposium on Theoretical Computer Science, 1984.
S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory It-24 (1978). 106–110
R. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM. Feb 1978, volume 21. number 2. 120–128.
C. Schnorr and H. W. Lenstra Jr.. A Monte Carlo Factoring Algorithm with Finite Storage. to appear in Mathematics of Computation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ElGamal, T. (1985). A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_2
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive