Elliptic Curve Digital Signature Algorithm
E195587
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.
All labels observed (6)
How this entity was disambiguated
This entity first appeared as the object of triple T1711993 — 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: Elliptic Curve Digital Signature Algorithm Context triple: [Elliptic Curve Cryptography, includesScheme, Elliptic Curve Digital Signature Algorithm]
-
A.
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.
-
B.
Koblitz curves
Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of elliptic curve cryptography.
-
C.
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.
-
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.
ECC
ECC is a public-key cryptography approach that uses the mathematics of elliptic curves 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: Elliptic Curve Digital Signature Algorithm Target entity description: 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.
-
A.
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.
-
B.
Koblitz curves
Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of elliptic curve cryptography.
-
C.
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.
-
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.
ECC
ECC is a public-key cryptography approach that uses the mathematics of elliptic curves to provide strong security with relatively small key sizes.
- F. None of above. chosen
Statements (60)
| Predicate | Object |
|---|---|
| instanceOf |
asymmetric cryptographic primitive
ⓘ
digital signature algorithm ⓘ public-key cryptographic algorithm ⓘ |
| abbreviation | ECDSA ⓘ |
| advantage | smaller key sizes for comparable security ⓘ |
| basedOn | discrete logarithm problem on elliptic curves ⓘ |
| category | elliptic curve cryptography ⓘ |
| commonlyUsedCurve |
P-256
ⓘ
linked to:
NIST P-256 family
P-384 ⓘ P-521 ⓘ secp256k1 ⓘ secp256r1 ⓘ |
| comparedTo |
Digital Signature Algorithm
ⓘ
linked to:
DSA (Digital Signature Algorithm)
|
| deterministicVariantSpecifiedIn | RFC 6979 ⓘ |
| hasAdvantageOver | RSA ⓘ |
| hasProperty |
compact signatures
ⓘ
high security per bit of key length ⓘ short key sizes ⓘ |
| hasVariant | deterministic ECDSA ⓘ |
| introducedAs | elliptic curve analogue of DSA ⓘ |
| operatesOver |
binary fields
ⓘ
finite fields ⓘ prime fields ⓘ |
| produces | public key ⓘ |
| provides |
authentication
ⓘ
data integrity ⓘ digital signatures ⓘ |
| requires |
base point on elliptic curve
ⓘ
cryptographically secure random nonce ⓘ elliptic curve domain parameters ⓘ private key ⓘ |
| securityDependsOn | difficulty of elliptic curve discrete logarithm problem ⓘ |
| signatureComponent |
r
ⓘ
s ⓘ |
| standardizedIn |
ANSI X9.62
ⓘ
linked to:
Elliptic Curve Digital Signature Algorithm
FIPS 186-2 ⓘ FIPS 186-3 ⓘ
linked to:
FIPS 186-2
FIPS 186-4 ⓘ
linked to:
FIPS 186-2
IEEE P1363 ⓘ SEC 1 ⓘ |
| typicallyUsedWith |
SHA-2 hash functions
ⓘ
SHA-256 ⓘ SHA-384 ⓘ |
| usedIn |
Bitcoin
ⓘ
Ethereum ⓘ
linked to:
Ethereum blockchain
IoT devices ⓘ PGP ⓘ SSH ⓘ TLS 1.2 ⓘ TLS 1.3 ⓘ
linked to:
RFC 8446
Transport Layer Security ⓘ
linked to:
TLS
X.509 certificates ⓘ blockchain systems ⓘ code signing ⓘ cryptocurrencies ⓘ embedded systems ⓘ smart cards ⓘ |
| usesMathematicsOf | elliptic curves ⓘ |
| vulnerableIf |
nonces are predictable
ⓘ
nonces are reused ⓘ |
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: Elliptic Curve Digital Signature Algorithm Description of subject: 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.
Referenced by (28)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
subject linked to:
JSON Web Tokens (JWT)
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
subject linked to:
DSA (Digital Signature Algorithm)
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
RFC 6979
→
title
→
Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA)
ⓘ
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm
linked to: Elliptic Curve Digital Signature Algorithm