Workshop on the Theory and Application of Cryptographic Techniques A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Conference paper First Online: 24 November 2000 DOI:
196 of the book series
Lecture Notes in Computer Science (LNCS) Cite this paper as: 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 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.
Download to read the full conference paper text 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.
MathSciNet Google Scholar
W. Diffie and M. Hellman. New Directions in Cryptography, IEEE Transactions on Information Theory, IT-22 (1976). 472–492.
MathSciNet Google Scholar
T. ElGamal. A Subexponential-Time Algorithm for Computing Discrete Logarithms over
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
) and its cryptographic significance, IEEE Transactions on Information Theory It-24 (1978). 106–110
CrossRef MathSciNet Google Scholar
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.
MATH CrossRef MathSciNet Google Scholar
C. Schnorr and H. W. Lenstra Jr.. A Monte Carlo Factoring Algorithm with Finite Storage. to appear in Mathematics of Computation.
© Springer-Verlag Berlin Heidelberg 1985