Curve448
E831085
Curve448 is a high-security elliptic curve designed for modern cryptographic protocols, particularly for efficient and secure key exchange and digital signatures.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Curve448 canonical | 1 |
| Edwards-curve Digital Signature Algorithm over Curve448 | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9932115 — 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: Curve448 Context triple: [Ed448, usesCurve, Curve448]
-
A.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
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.
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.
-
D.
brainpool curves
Brainpool curves are a family of elliptic curves over prime fields designed to provide high-security, efficiently implementable alternatives to earlier standardized curves in elliptic curve cryptography.
-
E.
EdDSA
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Curve448 Target entity description: Curve448 is a high-security elliptic curve designed for modern cryptographic protocols, particularly for efficient and secure key exchange and digital signatures.
-
A.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
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.
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.
-
D.
brainpool curves
Brainpool curves are a family of elliptic curves over prime fields designed to provide high-security, efficiently implementable alternatives to earlier standardized curves in elliptic curve cryptography.
-
E.
EdDSA
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.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic primitive
ⓘ
elliptic curve ⓘ public-key cryptography scheme ⓘ |
| alias | Goldilocks curve NERFINISHED ⓘ |
| applicationDomain |
Transport Layer Security (TLS)
NERFINISHED
ⓘ
VPN protocols ⓘ secure messaging protocols ⓘ |
| basePointOrder | large prime order subgroup ⓘ |
| belongsToFamily | safe-curves ⓘ |
| bitLength | 448 bits ⓘ |
| cofactor | 4 ⓘ |
| comparedTo | Curve25519 NERFINISHED ⓘ |
| coordinateSystem | Montgomery coordinates ⓘ |
| cryptographicStrength | intended to be secure against large-scale classical adversaries ⓘ |
| curveEquationType | Montgomery form y^2 = x^3 + Ax^2 + x over F_p ⓘ |
| curveForm | Montgomery curve NERFINISHED ⓘ |
| designedFor |
digital signatures
ⓘ
high-security applications ⓘ key exchange ⓘ modern cryptographic protocols ⓘ |
| designObjective |
high performance at high security level
ⓘ
simple, auditable specification ⓘ |
| fieldCharacteristic | 2^448 - 2^224 - 1 ⓘ |
| fieldType | prime field ⓘ |
| introducedBy | Mike Hamburg NERFINISHED ⓘ |
| introducedIn | 2015 ⓘ |
| mathematicalStructure | group of points over a finite field ⓘ |
| notDesignedFor | post-quantum security ⓘ |
| offersHigherSecurityThan | Curve25519 NERFINISHED ⓘ |
| primeFieldSize | 448-bit prime ⓘ |
| property |
designed to avoid implementation pitfalls
ⓘ
rigidly defined curve parameters ⓘ supports constant-time implementations ⓘ |
| recommendedBy | IETF NERFINISHED ⓘ |
| relatedStandard | TLS 1.3 recommended groups ⓘ |
| securityGoal |
resistance to known classical attacks on elliptic curves
ⓘ
side-channel resistance in typical implementations ⓘ |
| securityLevel | approximately 224-bit security ⓘ |
| standardizedIn |
RFC 7748
NERFINISHED
ⓘ
RFC 8032 NERFINISHED ⓘ |
| supportsProtocol |
Ed448
NERFINISHED
ⓘ
X448 ⓘ |
| usedFor |
Diffie–Hellman key exchange
NERFINISHED
ⓘ
Elliptic Curve Diffie–Hellman (ECDH) NERFINISHED ⓘ digital signature schemes ⓘ |
| usedIn |
Ed448 signature scheme
NERFINISHED
ⓘ
X448 key agreement scheme ⓘ |
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: Curve448 Description of subject: Curve448 is a high-security elliptic curve designed for modern cryptographic protocols, particularly for efficient and secure key exchange and digital signatures.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.