RIPEMD-160
E299186
RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
All labels observed (2)
| Label | Occurrences |
|---|---|
| RIPEMD-160 canonical | 3 |
| RACE Integrity Primitives Evaluation Message Digest 160 | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2792455 — 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.
Target entity: RIPEMD-160 Context triple: [GNU Privacy Guard, supportsAlgorithm, RIPEMD-160]
-
A.
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.
-
B.
MD5
MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: RIPEMD-160 Target entity description: RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
-
A.
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.
-
B.
MD5
MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic hash function
ⓘ
hash function ⓘ |
| abbreviationOf |
RIPEMD-160
self-linksurface differs
ⓘ
surface form:
RACE Integrity Primitives Evaluation Message Digest 160
|
| basedOn | RIPEMD ⓘ |
| bitLength | 160 bits ⓘ |
| blockSize | 512 bits ⓘ |
| category |
computer security
ⓘ
cryptography ⓘ |
| collisionResistance | designed to be collision resistant ⓘ |
| comparedTo | SHA-1 ⓘ |
| compressionFunctionStructure |
Merkle–Damgård construction
ⓘ
surface form:
Merkle–Damgård
|
| designedAsAlternativeTo | SHA-1 ⓘ |
| designedBy |
Antoon Bosselaers
ⓘ
Bart Preneel ⓘ Hans Dobbertin NERFINISHED ⓘ |
| designedFor |
data integrity
ⓘ
digital signatures ⓘ message authentication ⓘ security applications ⓘ |
| designFeature | dual parallel line structure ⓘ |
| designGoal |
alternative to SHA family
ⓘ
improved security over original RIPEMD ⓘ |
| developedAt |
COSIC
ⓘ
KU Leuven ⓘ
surface form:
Katholieke Universiteit Leuven
|
| digestSize | 20 bytes ⓘ |
| family | RIPEMD ⓘ |
| hashes | arbitrary-length input ⓘ |
| introducedIn | 1996 ⓘ |
| numberOfRounds | 80 ⓘ |
| operatesOn | little-endian 32-bit words ⓘ |
| originProject | RACE project ⓘ |
| outputSize | 160 bits ⓘ |
| predecessor | RIPEMD ⓘ |
| preimageResistance | designed to be preimage resistant ⓘ |
| produces | fixed-length output ⓘ |
| roundFunctionType | ARX (add-rotate-xor) ⓘ |
| secondPreimageResistance | designed to be second-preimage resistant ⓘ |
| securityLevel | considered secure as of mid-2010s for many applications ⓘ |
| standardizedIn | ISO/IEC 10118-3 ⓘ |
| successorVariant |
RIPEMD
ⓘ
surface form:
RIPEMD-256
RIPEMD ⓘ
surface form:
RIPEMD-320
|
| usedIn |
Bitcoin address generation
ⓘ
RFC 4880 ⓘ
surface form:
OpenPGP
PGP ⓘ blockchain applications ⓘ cryptocurrency systems ⓘ |
| uses | Davies–Meyer compression function ⓘ |
| 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.
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.
Subject: RIPEMD-160 Description of subject: RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.