Triple
T1798500
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | TLS 1.0 |
E39658
|
entity |
| Predicate | hasVulnerability |
P583
|
FINISHED |
| Object |
BEAST attack
The BEAST attack is a cryptographic exploit that targets vulnerabilities in early versions of TLS/SSL to decrypt secure HTTPS traffic by abusing weaknesses in block cipher modes like CBC.
|
E200937
|
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: BEAST attack | Statement: [TLS 1.0, hasVulnerability, BEAST attack]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: BEAST attack Context triple: [TLS 1.0, hasVulnerability, BEAST attack]
-
A.
Spritz cipher
Spritz cipher is a modern stream cipher and hash function designed by Ronald Rivest and Jacob Schuldt as a more secure and flexible successor to RC4.
-
B.
Shamir’s attack on RSA with low decryption exponent
Shamir’s attack on RSA with low decryption exponent is a cryptanalytic method that exploits unusually small private exponents in RSA to efficiently recover the secret key and break the encryption.
-
C.
differential cryptanalysis
Differential cryptanalysis is a powerful method of cryptanalysis that studies how differences in input can affect the resultant differences at the output of a cipher to reveal information about its secret key.
-
D.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
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.
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: BEAST attack Triple: [TLS 1.0, hasVulnerability, BEAST attack]
Generated description
The BEAST attack is a cryptographic exploit that targets vulnerabilities in early versions of TLS/SSL to decrypt secure HTTPS traffic by abusing weaknesses in block cipher modes like CBC.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: BEAST attack Target entity description: The BEAST attack is a cryptographic exploit that targets vulnerabilities in early versions of TLS/SSL to decrypt secure HTTPS traffic by abusing weaknesses in block cipher modes like CBC.
-
A.
Spritz cipher
Spritz cipher is a modern stream cipher and hash function designed by Ronald Rivest and Jacob Schuldt as a more secure and flexible successor to RC4.
-
B.
Shamir’s attack on RSA with low decryption exponent
Shamir’s attack on RSA with low decryption exponent is a cryptanalytic method that exploits unusually small private exponents in RSA to efficiently recover the secret key and break the encryption.
-
C.
differential cryptanalysis
Differential cryptanalysis is a powerful method of cryptanalysis that studies how differences in input can affect the resultant differences at the output of a cipher to reveal information about its secret key.
-
D.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
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
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_69a88632aa588190ba3978fde0db5bbd |
completed | March 4, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69aa6568373c81908044e0cd8a38344d |
completed | March 6, 2026, 5:26 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69adb5d8da888190a88f3bd8036e19f4 |
completed | March 8, 2026, 5:46 p.m. |
| NEDg | Description generation | batch_69adb69c149081908b5b819c068a1ce2 |
completed | March 8, 2026, 5:49 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69adb8be528c819092a5e22b099fc2a0 |
completed | March 8, 2026, 5:58 p.m. |
Created at: March 4, 2026, 7:32 p.m.