What is recorded here?
ElGamal turns a Diffie–Hellman-style shared value into a randomized public-key encryption construction and gives a separate signature/verification relation over a prime finite field. Fresh secret randomness produces different ciphertext pairs, while signatures can be checked with a public key. The original conference paper analyzes costs and limitations rather than granting an unconditional proof against every attack.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
This target is CRYPTO'84 proceedings pages 10–18, published 1985; the journal edition is not another credited contribution. The paper explicitly leaves general signature-breaking/discrete-log equivalence unproved, requires fresh nonce use and notes a forgery/message-structure caveat. Historical hardness estimates are not current deployment guidance, modern chosen-ciphertext security or post-quantum protection.
Read the original work
- Taher ElGamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, Advances in Cryptology—CRYPTO'84, LNCS196,10–18 (1985)
- Springer original-chapter metadata: ElGamal, CRYPTO1984 proceedings, LNCS196, DOI10.1007/3-540-39568-7_2
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Taher ElGamal
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
ElGamal: discrete-logarithm encryption and signature constructions
ElGamal turns a Diffie–Hellman-style shared value into a randomized public-key encryption construction and gives a separate signature/verification relation over a prime finite field.
Fresh secret randomness produces different ciphertext pairs, while signatures can be checked with a public key. The original conference paper analyzes costs and limitations rather than granting an unconditional proof against every attack.
Scientific scope
This target is CRYPTO'84 proceedings pages 10–18, published 1985; the journal edition is not another credited contribution. The paper explicitly leaves general signature-breaking/discrete-log equivalence unproved, requires fresh nonce use and notes a forgery/message-structure caveat. Historical hardness estimates are not current deployment guidance, modern chosen-ciphertext security or post-quantum protection.
People and systems
Taher ElGamal