MD5
E192654
MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
All labels observed (2)
How this entity was disambiguated
This entity first appeared as the object of triple T1711785 — 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: MD5 Context triple: [HMAC, typicalHashFunction, MD5]
-
A.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
-
B.
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.
-
C.
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.
-
D.
Merkle tree
A Merkle tree is a cryptographic data structure that uses a tree of hash values to efficiently and securely verify the integrity and consistency of large sets of data.
-
E.
RC6
RC6 is a symmetric block cipher designed as a candidate for the Advanced Encryption Standard (AES), known for its simplicity, efficiency, and parameterized structure.
- 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: MD5 Target entity description: MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
-
A.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
-
B.
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.
-
C.
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.
-
D.
Merkle tree
A Merkle tree is a cryptographic data structure that uses a tree of hash values to efficiently and securely verify the integrity and consistency of large sets of data.
-
E.
RC6
RC6 is a symmetric block cipher designed as a candidate for the Advanced Encryption Standard (AES), known for its simplicity, efficiency, and parameterized structure.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
checksum algorithm
ⓘ
cryptographic hash function ⓘ hash function ⓘ |
| alsoKnownAs | Message-Digest Algorithm 5 ⓘ |
| basedOn | MD4 ⓘ |
| bitLength | 128-bit ⓘ |
| blockSize | 512 bits ⓘ |
| category | broken hash function ⓘ |
| collisionComplexity | significantly lower than 2^64 ⓘ |
| collisionFirstPublicBreakYear | 2004 ⓘ |
| collisionResistance | broken ⓘ |
| designedBy |
Ronald Rivest
ⓘ
linked to:
Ronald L. Rivest
|
| designer |
Ronald Rivest
ⓘ
linked to:
Ronald L. Rivest
|
| digestSize | 128 bits ⓘ |
| discouragedBy | security standards bodies ⓘ |
| follows | Merkle–Damgård construction ⓘ |
| formerUse |
X.509 certificates
ⓘ
digital signatures ⓘ file integrity checking ⓘ message authentication codes ⓘ software distribution checksums ⓘ |
| hasDigestRepresentation | 32-character hexadecimal string ⓘ |
| hashFunctionFamily | MDx family ⓘ |
| introducedBy |
RSA Data Security, Inc.
ⓘ
linked to:
RSA Security
|
| notRecommendedFor |
TLS certificates
ⓘ
linked to:
X.509 certificates
digital signatures ⓘ new security protocols ⓘ password hashing ⓘ |
| operatesOn | arbitrary-length input ⓘ |
| outputSize | 128 bits ⓘ |
| preimageResistance | weakened ⓘ |
| produces | fixed-length hash value ⓘ |
| publicationYear | 1992 ⓘ |
| recommendedFor | non-cryptographic checksums only ⓘ |
| replacedBy |
SHA-2
ⓘ
SHA-3 ⓘ
linked to:
Keccak
|
| secondPreimageResistance | weakened ⓘ |
| specifiedIn | RFC 1321 ⓘ |
| standardizedIn |
RFC 1321
ⓘ
linked to:
MD5
|
| status | cryptographically broken ⓘ |
| successorOf | MD4 ⓘ |
| usedIn | legacy systems ⓘ |
| uses |
bitwise operations
ⓘ
modular addition ⓘ nonlinear functions ⓘ |
| vulnerableTo |
chosen-prefix collision attacks
ⓘ
collision attacks ⓘ length extension attacks ⓘ |
| wordSize | 32 bits ⓘ |
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: MD5 Description of subject: MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
Referenced by (12)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: MD5