Live briefing
Everything about RIPEMD
Cryptographic hash function
RIPEMD is a family of cryptographic hash functions developed in 1992 and 1996. There are five functions in the family: RIPEMD, RIPEMD-128, RIPEMD-160, RIPEMD-256, and RIPEMD-320, of which RIPEMD-160 is the most common. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: RIPEMDA 5-minute orientation
- Skim a recent paper: Collision Attacks on Reduced RIPEMD-128Influential work since 2022
- Pick up a classic book: Advances in Cryptology – EUROCRYPT 2013The most-reprinted book on the subject
- Read the landmark paper: RIPEMD with two-round compress function is not collision-freeCited 55 times
- Go sideways: Bart PreneelA closely related topic
- Go sideways: MD4A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
RIPEMD with two-round compress function is not collision-free
ASIC-hardware-focused comparison for hash functions MD5, RIPEMD-160, and SHS
On the hardware implementation of RIPEMD processor: Networking high speed hashing, up to 2Gbps
Cryptanalysis of Reduced RIPEMD-128
Automating Collision Attacks on RIPEMD-160
Improved cryptanalysis on RIPEMD‐128
Keyed/Unkeyed RIPEMD-128, 192, 256
Cryptanalysis of 48-step RIPEMD-160
🆕 Influential since 2022
📚 Books worth reading
Advances in Cryptology – EUROCRYPT 2013Thomas Johansson · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Bart Preneel Bart Preneel (born 15 October 1963 in Leuven, Belgium[better source needed]) is a Belgian cryptographer and cryptanalyst. He is a professor at Katholieke…
- MD4 The MD4 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1990. The digest length is 128 bits. The algorithm has…
- Comparison of cryptographic hash functions The following tables compare general and technical information for a number of cryptographic hash functions. See the individual functions' articles for…
- Hash function security summary This article summarizes publicly known attacks against cryptographic hash functions. Note that not all entries may be up to date. For a summary of other…
- Cryptographic hash function A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n bits) that has special…
- N-hash In cryptography, N-hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 in an…
- FORK-256 FORK-256 is a hash algorithm designed in response to security issues discovered in the earlier SHA-1 and MD5 algorithms. After substantial cryptanalysis…
- Tiger (hash function) In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size of…