Triple
T1712007
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Elliptic Curve Cryptography |
E37202
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object |
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.
|
E192666
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Koblitz curves | Statement: [Elliptic Curve Cryptography, hasVariant, Koblitz curves]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Koblitz curves Context triple: [Elliptic Curve Cryptography, hasVariant, Koblitz 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.
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.
-
C.
Berlekamp’s algorithm for factoring polynomials over finite fields
Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
-
D.
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.
-
E.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Koblitz curves Triple: [Elliptic Curve Cryptography, hasVariant, Koblitz curves]
Generated description
Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of elliptic curve cryptography.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Koblitz curves Target entity description: Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of 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.
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.
-
C.
Berlekamp’s algorithm for factoring polynomials over finite fields
Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
-
D.
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.
-
E.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
- F. None of above. chosen
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69a8861912dc8190931af43b4b9158a7 |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69aa6315afdc81908409435bb47e8ee0 |
completed | March 6, 2026, 5:16 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad8addf4a48190b19cdb861db5eecd |
completed | March 8, 2026, 2:42 p.m. |
| NEDg | Description generation | batch_69ad957adf1c8190b7c8656c1984f998 |
completed | March 8, 2026, 3:27 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69ad97af6b388190b2af293599108df3 |
completed | March 8, 2026, 3:37 p.m. |
Created at: March 4, 2026, 7:30 p.m.