MD4
E830583
MD4 is a cryptographic hash function designed by Ronald Rivest that produces a 128-bit hash value and served as the basis for later algorithms like MD5.
All labels observed (1)
| Label | Occurrences |
|---|---|
| MD4 canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9931342 — 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: MD4 Context triple: [MD5, basedOn, MD4]
-
A.
MD5
MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
-
B.
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.
-
C.
RIPEMD-160
RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
-
D.
SHA-0
SHA-0 is an early, now-obsolete cryptographic hash function in the Secure Hash Algorithm family, known for its structural weaknesses and subsequent replacement by SHA-1.
-
E.
CRAM-MD5
CRAM-MD5 is a challenge–response authentication mechanism that uses MD5 hashing to securely verify a user's identity without transmitting their password in plaintext.
- 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: MD4 Target entity description: MD4 is a cryptographic hash function designed by Ronald Rivest that produces a 128-bit hash value and served as the basis for later algorithms like MD5.
-
A.
MD5
MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
-
B.
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.
-
C.
RIPEMD-160
RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
-
D.
SHA-0
SHA-0 is an early, now-obsolete cryptographic hash function in the Secure Hash Algorithm family, known for its structural weaknesses and subsequent replacement by SHA-1.
-
E.
CRAM-MD5
CRAM-MD5 is a challenge–response authentication mechanism that uses MD5 hashing to securely verify a user's identity without transmitting their password in plaintext.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf | cryptographic hash function ⓘ |
| abbreviationFor | Message Digest 4 NERFINISHED ⓘ |
| blockSize | 512 bits ⓘ |
| byteOrder | little-endian ⓘ |
| category | message digest algorithm ⓘ |
| collisionFound | true ⓘ |
| collisionResistanceStatus | broken ⓘ |
| compressionFunctionRounds | 3 ⓘ |
| cryptanalysis | differential cryptanalysis ⓘ |
| designedAt | MIT NERFINISHED ⓘ |
| designedFor | software implementation ⓘ |
| designer | Ronald Rivest NERFINISHED ⓘ |
| family | MD hash functions ⓘ |
| firstMajorCryptanalysisBy | Hans Dobbertin GENERATED ⓘ |
| firstMajorCryptanalysisYear | 1996 GENERATED ⓘ |
| hashLength | 128 bits ⓘ |
| inspiredAlgorithm |
HAVAL
ⓘ
MD5 ⓘ RIPEMD NERFINISHED ⓘ RIPEMD-128 NERFINISHED ⓘ RIPEMD-160 NERFINISHED ⓘ |
| internalStateSize | 128 bits ⓘ |
| introducedIn | 1990 ⓘ |
| knownCollisionAttackComplexity | less than 2^20 operations ⓘ |
| operatesOn | arbitrary-length messages ⓘ |
| optimizedFor | 32-bit processors ⓘ |
| outputRepresentation | typically 32-hex-character string ⓘ |
| outputSize | 128 bits ⓘ |
| paddingScheme | MD-strengthening ⓘ |
| preimageResistanceStatus | weakened ⓘ |
| produces | fixed-length hash value ⓘ |
| publishedIn | 1990 ⓘ |
| roundFunctions | three distinct Boolean functions ⓘ |
| secondPreimageResistanceStatus | weakened ⓘ |
| securityRecommendation | do not use for new designs ⓘ |
| specifiedIn | RFC 1320 NERFINISHED ⓘ |
| standardizedIn | RFC 1320 ⓘ |
| status | obsolete ⓘ |
| successor |
MD5
NERFINISHED
ⓘ
SHA-1 (conceptual lineage) NERFINISHED ⓘ |
| suitableForGeneralSecurityUse | false ⓘ |
| usedIn |
Microsoft Windows password hashing (legacy)
NERFINISHED
ⓘ
NTLM (legacy) NERFINISHED ⓘ |
| usesMerkleDamgårdConstruction | true ⓘ |
| 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: MD4 Description of subject: MD4 is a cryptographic hash function designed by Ronald Rivest that produces a 128-bit hash value and served as the basis for later algorithms like MD5.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.