Ed448
E192670
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Ed448 canonical | 3 |
How this entity was disambiguated
This entity first appeared as the object of triple T1712044 — 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.
Target entity: Ed448 Context triple: [DNSSEC, supportsAlgorithm, Ed448]
-
A.
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.
-
B.
Poly1305
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
C.
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.
-
D.
Merkle
Merkle is a surname most prominently associated with Ralph Merkle, a pioneering computer scientist and cryptographer known for his foundational work in public-key cryptography and Merkle trees.
-
E.
Merkle–Damgård construction
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Ed448 Target entity description: Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
A.
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.
-
B.
Poly1305
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
C.
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.
-
D.
Merkle
Merkle is a surname most prominently associated with Ralph Merkle, a pioneering computer scientist and cryptographer known for his foundational work in public-key cryptography and Merkle trees.
-
E.
Merkle–Damgård construction
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
digital signature algorithm
ⓘ
elliptic-curve signature scheme ⓘ |
| basedOn | elliptic-curve cryptography ⓘ |
| belongsToCategory | public-key cryptography ⓘ |
| comparedTo | Ed25519 ⓘ |
| curveEquationType | twisted Edwards curve ⓘ |
| curveFieldSize | 448-bit prime field ⓘ |
| definedInSection |
RFC 8032
ⓘ
surface form:
RFC 8032, Section 5
|
| designedFor |
efficient performance
ⓘ
high security ⓘ |
| designGoal |
constant-time implementations
ⓘ
robustness against misuse of randomness ⓘ simplicity of implementation ⓘ |
| encoding |
compressed point representation
ⓘ
little-endian byte encoding for field elements ⓘ |
| fullName |
Curve448
ⓘ
surface form:
Edwards-curve Digital Signature Algorithm over Curve448
|
| hashFunctionUsed | SHAKE256 ⓘ |
| introducedIn | 2010s ⓘ |
| keyDerivation | public key derived by scalar multiplication of base point ⓘ |
| keyGenerationMethod | private key is uniformly random 57-byte string ⓘ |
| memberOfFamily | EdDSA ⓘ |
| offersHigherSecurityThan | Ed25519 ⓘ |
| privateKeySize | 57 bytes ⓘ |
| property |
cofactor 4
ⓘ
collision-resistance depends on SHAKE256 ⓘ designed to resist side-channel attacks with proper implementation ⓘ large prime-order subgroup ⓘ not vulnerable to small-subgroup attacks when implemented as specified ⓘ |
| publicKeySize | 57 bytes ⓘ |
| recommendedFor | long-term security applications ⓘ |
| requires |
constant-time big-integer arithmetic for side-channel resistance
ⓘ
secure implementation of SHAKE256 ⓘ |
| securityLevel | approximately 224-bit classical security ⓘ |
| signatureComputation | uses nonce derived from private key and message via hash ⓘ |
| signatureSize | 114 bytes ⓘ |
| standardizedBy |
Internet Engineering Task Force
ⓘ
surface form:
IETF
|
| standardizedIn | RFC 8032 ⓘ |
| suitableFor |
hardware implementations
ⓘ
software implementations ⓘ |
| supports |
batch verification
ⓘ
deterministic signatures ⓘ prehash variant Ed448ph ⓘ |
| usedIn |
SSH (optional signature algorithm in some implementations)
ⓘ
TLS 1.3 (optional signature algorithm) ⓘ |
| usesBasePoint | fixed generator on Curve448 ⓘ |
| usesCoordinateSystem | twisted Edwards coordinates ⓘ |
| usesCurve | Curve448 ⓘ |
| verificationMethod | checks group equation involving public key, signature, and message hash ⓘ |
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.
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.
Subject: Ed448 Description of subject: Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.