EdDSA
E299184
EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
All labels observed (6)
| Label | Occurrences |
|---|---|
| EdDSA canonical | 8 |
| Edwards-Curve Digital Signature Algorithm (EdDSA) | 1 |
| Edwards-curve Digital Signature Algorithm over Curve25519 | 1 |
| HashEdDSA | 1 |
| PureEdDSA | 1 |
| VXEdDSA | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2792448 — 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: EdDSA Context triple: [GNU Privacy Guard, supportsAlgorithm, EdDSA]
-
A.
Ed25519
Ed25519 is a high-speed, high-security elliptic-curve digital signature scheme widely used in modern cryptographic protocols and software.
-
B.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
C.
Elliptic Curve Digital Signature Algorithm
Elliptic Curve Digital Signature Algorithm is a public-key cryptographic method that uses elliptic curve mathematics to create compact, secure digital signatures for authentication and data integrity.
-
D.
Curve25519-based schemes
Curve25519-based schemes are cryptographic protocols and algorithms that use the Curve25519 elliptic curve to provide efficient, high-security public-key operations such as key exchange and digital signatures.
-
E.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
- 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: EdDSA Target entity description: EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
-
A.
Ed25519
Ed25519 is a high-speed, high-security elliptic-curve digital signature scheme widely used in modern cryptographic protocols and software.
-
B.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
C.
Elliptic Curve Digital Signature Algorithm
Elliptic Curve Digital Signature Algorithm is a public-key cryptographic method that uses elliptic curve mathematics to create compact, secure digital signatures for authentication and data integrity.
-
D.
Curve25519-based schemes
Curve25519-based schemes are cryptographic protocols and algorithms that use the Curve25519 elliptic curve to provide efficient, high-security public-key operations such as key exchange and digital signatures.
-
E.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
digital signature scheme
ⓘ
public-key cryptographic algorithm ⓘ |
| advantage |
fast signing
ⓘ
fast verification ⓘ small key sizes ⓘ small signature sizes ⓘ |
| application |
SSH
ⓘ
TLS ⓘ cryptographic libraries ⓘ |
| avoids | need for high-quality randomness per signature ⓘ |
| basedOn | Schnorr signature scheme ⓘ |
| benefitOverECDSA |
better resistance to side-channel attacks when implemented correctly
ⓘ
deterministic nonce derivation ⓘ simpler implementation ⓘ |
| category | elliptic-curve signature scheme ⓘ |
| commonlyUsedWithCurve |
Ed25519
ⓘ
Ed448 ⓘ |
| contrastWith |
ECDSA
ⓘ
linked to:
Elliptic Curve Digital Signature Algorithm
|
| curveForEd25519 |
Curve25519 in Edwards form
ⓘ
linked to:
Twisted Edwards curve
|
| curveForEd448 | Curve448 in Edwards form ⓘ |
| designGoal |
deterministic signatures
ⓘ
high performance ⓘ high security ⓘ resistance to side-channel attacks ⓘ |
| fullName |
Edwards-curve Digital Signature Algorithm
ⓘ
linked to:
Twisted Edwards curve
|
| introducedBy |
Bo-Yin Yang
ⓘ
Daniel J. Bernstein ⓘ Niels Duif ⓘ Peter Schwabe ⓘ Tanja Lange ⓘ |
| keyType |
private-key
ⓘ
public-key ⓘ |
| nonceDerivation | derived from private key and message via hash ⓘ |
| property | strongly unforgeable under chosen-message attacks (SUF-CMA) when properly instantiated ⓘ |
| securityBasis | elliptic curve discrete logarithm problem ⓘ |
| signatureComponent |
R value
ⓘ
S value ⓘ |
| signatureGeneration | deterministic ⓘ |
| standardizationBody |
IETF
ⓘ
linked to:
Internet Engineering Task Force
|
| standardizedIn | RFC 8032 ⓘ |
| supports | batch verification of signatures ⓘ |
| usesCoordinateRepresentation | compressed public keys ⓘ |
| usesCoordinateSystem | Edwards coordinates ⓘ |
| usesCurveType |
twisted Edwards curves
ⓘ
linked to:
Twisted Edwards curve
|
| usesHashFunction | cryptographic hash function ⓘ |
| variant |
Ed25519
ⓘ
Ed448 ⓘ |
| yearProposed | 2011 ⓘ |
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: EdDSA Description of subject: EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
Referenced by (13)
Full triples — surface form annotated when it differs from this entity's canonical label.