ElGamal
E184257
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
All labels observed (5)
| Label | Occurrences |
|---|---|
| ElGamal canonical | 2 |
| ElGamal encryption | 1 |
| ElGamal signature scheme | 1 |
| elliptic curve ElGamal | 1 |
| threshold ElGamal | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1635052 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: ElGamal Context triple: [PGP, supportsAlgorithmType, ElGamal]
-
A.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
B.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
C.
Rijndael
Rijndael is a symmetric block cipher designed by Joan Daemen and Vincent Rijmen that was selected by NIST as the basis for the Advanced Encryption Standard (AES).
-
D.
PGP
PGP (Pretty Good Privacy) is an encryption program that provides cryptographic privacy and authentication for data communication, most notably for securing emails and files.
-
E.
Elliptic Curve Cryptography
Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: ElGamal Target entity description: ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
-
A.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
B.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
C.
Rijndael
Rijndael is a symmetric block cipher designed by Joan Daemen and Vincent Rijmen that was selected by NIST as the basis for the Advanced Encryption Standard (AES).
-
D.
PGP
PGP (Pretty Good Privacy) is an encryption program that provides cryptographic privacy and authentication for data communication, most notably for securing emails and files.
-
E.
Elliptic Curve Cryptography
Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
asymmetric cryptographic scheme
ⓘ
probabilistic encryption scheme ⓘ public-key cryptosystem ⓘ |
| application |
electronic voting protocols
ⓘ
key encapsulation mechanisms ⓘ mix-nets ⓘ secure messaging ⓘ |
| basedOn | discrete logarithm problem ⓘ |
| canBeImplementedIn |
hardware
ⓘ
software ⓘ |
| canBeMadeCCAsecureBy | appropriate padding or hybrid encryption ⓘ |
| category | number-theoretic cryptography ⓘ |
| ciphertextStructure | pair of group elements ⓘ |
| comparedTo | RSA ⓘ |
| decryptionRequires | knowledge of private exponent ⓘ |
| differenceFromRSA |
probabilistic encryption vs deterministic (basic RSA)
ⓘ
security based on discrete log vs integer factorization ⓘ |
| encryptionType | public-key encryption ⓘ |
| hasVariant |
ElGamal
self-linksurface differs
ⓘ
surface form:
ElGamal signature scheme
ElGamal self-linksurface differs ⓘ
surface form:
elliptic curve ElGamal
ElGamal self-linksurface differs ⓘ
surface form:
threshold ElGamal
|
| introducedInYear | 1985 ⓘ |
| keyGenerationInvolves |
choosing a secret exponent
ⓘ
computing a public group element as generator to the secret exponent ⓘ |
| keyType |
private key
ⓘ
public key ⓘ |
| messageSpace | elements of the underlying group or encoded messages ⓘ |
| namedAfter | Taher ElGamal ⓘ |
| originCountry |
US
ⓘ
surface form:
United States (research context)
|
| property |
probabilistic ciphertexts (same message encrypts to different ciphertexts)
ⓘ
semantic security under chosen-plaintext attack (with proper parameters) ⓘ |
| publishedIn | IEEE Transactions on Information Theory ⓘ |
| randomness | uses fresh random exponent for each encryption ⓘ |
| relatedTo |
DSA (Digital Signature Algorithm)
ⓘ
Diffie–Hellman key exchange ⓘ |
| requires |
generator of a cyclic group
ⓘ
large prime modulus or group order ⓘ secure random number generation ⓘ |
| securityDependsOn | hardness of discrete logarithm in cyclic groups ⓘ |
| standardizedIn | various cryptographic libraries and toolkits ⓘ |
| supports |
digital signatures
ⓘ
encryption ⓘ |
| supportsProperty | multiplicative homomorphism of ciphertexts ⓘ |
| typicallyDefinedOver |
elliptic curve groups
ⓘ
multiplicative group of a finite field ⓘ multiplicative group of integers modulo a prime ⓘ |
| usedIn |
cryptographic protocols
ⓘ
open-source cryptographic libraries such as GnuPG (historically) ⓘ |
| vulnerableTo | chosen-ciphertext attacks in basic form ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: ElGamal Description of subject: ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
ElGamal encryption
this entity surface form:
ElGamal signature scheme
this entity surface form:
elliptic curve ElGamal
this entity surface form:
threshold ElGamal