brainpool curves
E192665
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.
All labels observed (28)
How this entity was disambiguated
This entity first appeared as the object of triple T1712006 — 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: brainpool curves Context triple: [Elliptic Curve Cryptography, hasVariant, brainpool curves]
-
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.
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.
-
C.
RFC 3526
RFC 3526 is an Internet standard that defines modular exponential (MODP) Diffie–Hellman groups for use in secure key exchange protocols.
-
D.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
E.
ECC
ECC is the National Rail station code for Eccles railway station in Greater Manchester, England.
- 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: brainpool curves Target entity description: 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.
-
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.
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.
-
C.
RFC 3526
RFC 3526 is an Internet standard that defines modular exponential (MODP) Diffie–Hellman groups for use in secure key exchange protocols.
-
D.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
E.
ECC
ECC is the National Rail station code for Eccles railway station in Greater Manchester, England.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic primitive
ⓘ
elliptic curve family ⓘ |
| comparedTo |
NIST P-256
ⓘ
linked to:
NIST P-256 family
NIST P-384 ⓘ
linked to:
P-384
NIST P-521 ⓘ
linked to:
P-521
|
| countryOfOrigin | Germany ⓘ |
| curveType | Weierstrass form ⓘ |
| definedOver | prime fields ⓘ |
| designGoal |
alternative to earlier standardized curves
ⓘ
efficient implementation ⓘ high security ⓘ |
| designPhilosophy |
conservative security assumptions
ⓘ
transparency in parameter generation ⓘ |
| field | elliptic curve cryptography ⓘ |
| includesCurve |
brainpoolP160r1
ⓘ
linked to:
brainpool curves
brainpoolP160t1 ⓘ brainpoolP192r1 ⓘ
linked to:
brainpool curves
brainpoolP192t1 ⓘ
linked to:
brainpool curves
brainpoolP224r1 ⓘ brainpoolP224t1 ⓘ
linked to:
brainpool curves
brainpoolP256r1 ⓘ
linked to:
brainpool curves
brainpoolP256t1 ⓘ brainpoolP320r1 ⓘ
linked to:
brainpool curves
brainpoolP320t1 ⓘ brainpoolP384r1 ⓘ brainpoolP384t1 ⓘ
linked to:
brainpool curves
brainpoolP512r1 ⓘ
linked to:
brainpool curves
brainpoolP512t1 ⓘ
linked to:
brainpool curves
|
| introducedIn | 2000s ⓘ |
| motivation | avoid potential weaknesses in earlier NIST curves ⓘ |
| parameterGenerationMethod | SHA-1 based seed expansion ⓘ |
| primeFieldSizeRange | 160-bit to 512-bit primes ⓘ |
| property |
no special structure intended for backdoors
ⓘ
randomly generated curve parameters ⓘ verifiably pseudo-random generation process ⓘ |
| recommendedBy |
German Federal Office for Information Security (BSI)
ⓘ
linked to:
Federal Office for Information Security
|
| securityLevelRange | 128-bit to 256-bit security ⓘ |
| securityObjective |
avoidance of anomalous curves
ⓘ
avoidance of special prime forms ⓘ large embedding degree ⓘ resistance to known attacks on elliptic curves ⓘ |
| standardizedBy |
ECC Brainpool
ⓘ
linked to:
brainpool curves
IETF ⓘ
linked to:
Internet Engineering Task Force
|
| standardizedIn | RFC 5639 ⓘ |
| usedFor |
digital signatures
ⓘ
key agreement ⓘ public key encryption ⓘ |
| usedIn |
IPsec
ⓘ
TLS ⓘ X.509 certificates ⓘ |
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: brainpool curves Description of subject: 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.
Referenced by (28)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves
linked to: brainpool curves