Message-Digest Algorithm 5
E830584
Message-Digest Algorithm 5 (MD5) is a widely known but now cryptographically broken hash function that produces a 128-bit hash value and was once commonly used for checksums and data integrity verification.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Message-Digest Algorithm 5 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9931368 — 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: Message-Digest Algorithm 5 Context triple: [MD5, alsoKnownAs, Message-Digest Algorithm 5]
-
A.
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.
-
B.
SHA-2
SHA-2 is a family of cryptographic hash functions widely used for data integrity, digital signatures, and security protocols on the internet.
-
C.
SHA-256
SHA-256 is a widely used cryptographic hash function from the SHA-2 family that produces a 256-bit hash value for securing data integrity and authentication.
-
D.
Whirlpool hash function
Whirlpool is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto, known for its wide-pipe construction and strong security properties suitable for digital signatures and data integrity.
-
E.
SHA-1
SHA-1 is a now-legacy 160-bit cryptographic hash function once widely used for data integrity and digital signatures but today considered insecure due to practical collision attacks.
- 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: Message-Digest Algorithm 5 Target entity description: Message-Digest Algorithm 5 (MD5) is a widely known but now cryptographically broken hash function that produces a 128-bit hash value and was once commonly used for checksums and data integrity verification.
-
A.
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.
-
B.
SHA-2
SHA-2 is a family of cryptographic hash functions widely used for data integrity, digital signatures, and security protocols on the internet.
-
C.
SHA-256
SHA-256 is a widely used cryptographic hash function from the SHA-2 family that produces a 256-bit hash value for securing data integrity and authentication.
-
D.
Whirlpool hash function
Whirlpool is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto, known for its wide-pipe construction and strong security properties suitable for digital signatures and data integrity.
-
E.
SHA-1
SHA-1 is a now-legacy 160-bit cryptographic hash function once widely used for data integrity and digital signatures but today considered insecure due to practical collision attacks.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf | cryptographic hash function ⓘ |
| abbreviation | MD5 NERFINISHED ⓘ |
| blockSize | 512 bits ⓘ |
| category | broken cryptographic primitive ⓘ |
| chosenPrefixCollisionDemonstratedYear | 2007 ⓘ |
| collisionAttackComplexity | significantly less than 2^64 ⓘ |
| collisionResistanceStatus | broken ⓘ |
| commonlyUsedFor |
data integrity checks
ⓘ
file checksums ⓘ non-cryptographic fingerprinting ⓘ |
| compressionFunctionRounds | 64 ⓘ |
| cryptographicSecurityStatus | not recommended ⓘ |
| designedBy | Ronald Rivest NERFINISHED ⓘ |
| designGoal | improved security over MD4 ⓘ |
| designPredecessor | MD4 NERFINISHED ⓘ |
| digestLengthBytes | 16 ⓘ |
| firstCollisionPublishedYear | 2004 GENERATED ⓘ |
| hashOutputSize | 128 bits ⓘ |
| initialValueRegisterA | 0x67452301 ⓘ |
| initialValueRegisterB | 0xefcdab89 ⓘ |
| initialValueRegisterC | 0x98badcfe ⓘ |
| initialValueRegisterD | 0x10325476 ⓘ |
| internalStateSize | 128 bits ⓘ |
| notSuitableFor |
TLS certificates
NERFINISHED
ⓘ
code signing ⓘ digital signatures ⓘ password hashing ⓘ |
| numberOfRounds | 4 ⓘ |
| operatesOn | binary messages of arbitrary length ⓘ |
| outputEncodingCommonlyUsed | hexadecimal ⓘ |
| paddingMethod | bit-1 followed by zeros and length encoding ⓘ |
| practicalCollisionDemonstratedYear | 2004 ⓘ |
| preimageResistanceStatus | weakened ⓘ |
| publishedInYear | 1992 ⓘ |
| recommendationBySecurityCommunity | migrate to stronger hash functions ⓘ |
| secondPreimageResistanceStatus | weakened ⓘ |
| specifiedIn | RFC 1321 NERFINISHED ⓘ |
| standardizedBy |
Internet Engineering Task Force
ⓘ
surface form:
IETF
|
| supersededBy |
SHA-1
NERFINISHED
ⓘ
SHA-2 NERFINISHED ⓘ SHA-3 NERFINISHED ⓘ |
| usedIn | legacy applications ⓘ |
| usesMerkleDamgårdConstruction | true ⓘ |
| 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: Message-Digest Algorithm 5 Description of subject: Message-Digest Algorithm 5 (MD5) is a widely known but now cryptographically broken hash function that produces a 128-bit hash value and was once commonly used for checksums and data integrity verification.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.