RIPEMD explained

RIPEMD
Designers:Hans Dobbertin, Antoon Bosselaers and Bart Preneel
Publish Date:1992
Certification:RIPEMD-160: CRYPTREC (Monitored)
Digest Size:128, 160, 256, 320 bits

RIPEMD (RIPE Message Digest) is a family of cryptographic hash functions developed in 1992 (the original RIPEMD) and 1996 (other variants). 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.

The original RIPEMD, as well as RIPEMD-128, is not considered secure because 128-bit result is too small and also (for the original RIPEMD) because of design weaknesses. The 256- and 320-bit versions of RIPEMD provide the same level of security as RIPEMD-128 and RIPEMD-160, respectively; they are designed for applications where the security level is sufficient but longer hash result is necessary.

While RIPEMD functions are less popular than SHA-1 and SHA-2, they are used, among others, in Bitcoin and other cryptocurrencies based on Bitcoin.

History

The original RIPEMD function was designed in the framework of the EU project RIPE (RACE Integrity Primitives Evaluation) in 1992.[1] [2] Its design was based on the MD4 hash function. In 1996, in response to security weaknesses found in the original RIPEMD,[3] Hans Dobbertin, Antoon Bosselaers and Bart Preneel at the COSIC research group at the Katholieke Universiteit Leuven in Leuven, Belgium published four strengthened variants: RIPEMD-128, RIPEMD-160, RIPEMD-256, and RIPEMD-320.[4]

In August 2004, a collision was reported for the original RIPEMD.[5] This does not apply to RIPEMD-160.[6]

In 2019, the best collision attack for RIPEMD-160 could reach 34 rounds out of 80 rounds, which was published at CRYPTO 2019.[7]

In February 2023, a collision attack for RIPEMD-160 was published at EUROCRYPT 2023, which could reach 36 rounds out of 80 rounds with time complexity of 264.5.

In December 2023, an improved collision attack was found based on the technique from the previous best collision attack, this improved collision attack could reach 40 rounds out of 80 round with a theoretical time complexity of 249.9.[8]

RIPEMD-160 hashes

The 160-bit RIPEMD-160 hashes (also termed RIPE message digests) are typically represented as 40-digit hexadecimal numbers. The following demonstrates a 43-byte ASCII input and the corresponding RIPEMD-160 hash:

RIPEMD-160("The quick brown fox jumps over the lazy og") = 37f332f68db77bd9d7edd4969571ad671cf9dd3b

RIPEMD-160 behaves with the desired avalanche effect of cryptographic hash functions (small changes, e.g. changing to, result in a completely different hash):

RIPEMD-160("The quick brown fox jumps over the lazy og") = 132072df690933835eb8b6ad0b77e7b6f14acad7

The hash of a zero-length string is:

RIPEMD-160("") = 9c1185a5c5e9fc54612808977ee8f548b2258d31

Implementations

Below is a list of cryptography libraries that support RIPEMD (specifically RIPEMD-160):

See also

External links

Notes and References

  1. Hans. Dobbertin. Hans Dobbertin. Antoon. Bosselaers. Bart. Preneel. Bart Preneel. RIPEMD-160: A strengthened version of RIPEMD. Fast Software Encryption. Third International Workshop. Cambridge, UK. 21–23 February 1996. 71–82. 10.1007/3-540-60865-6_44. free.
  2. Book: Antoon. Bosselaers. Bart. Preneel. Bart Preneel. Integrity Primitives for Secure Information Systems. Final Report of RACE Integrity Primitives Evaluation (RIPE-RACE 1040). 1007. 1995. 10.1007/3-540-60640-8. Lecture Notes in Computer Science. 978-3-540-60640-6. Bosselaers. Antoon. Preneel. Bart. 12895857.
  3. Hans. Dobbertin. Hans Dobbertin. RIPEMD with two-round compress function is not collision-free. December 1997. Journal of Cryptology. 10. 1. 51–69. 10.1007/s001459900019. 15662054. free.
  4. Web site: The hash function RIPEMD-160. Antoon. Bosselaers.
  5. Wang . Xiaoyun . Xiaoyun Wang . Feng . Dengguo . Lai . Xuejia . Xuejia Lai . Yu . Hongbo . 2004-08-17 . Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD . . 2017-03-03.
  6. Book: Mendel . Florian . Pramstaller . Norbert . Rechberger . Christian . Rijmen . Vincent . Information Security . On the Collision Resistance of RIPEMD-160 . Lecture Notes in Computer Science . Vincent Rijmen . 2006 . 4176 . 101–116 . 10.1007/11836810_8 . 2017-03-03 . free. 978-3-540-38341-3 .
  7. Liu . Fukang . Dobraunig . Christoph . Mendel . Florian . Isobe . Takanori . Wang . Gaoli . Cao . Zhenfu . Advances in Cryptology – CRYPTO 2019, Proceesings vol 2 . Efficient Collision Attack Frameworks for RIPEMD-160 . 2019 . https://eprint.iacr.org/2018/652 . Lecture Notes in Computer Science . 11693 . 117–149 . 10.1007/978-3-030-26951-7_5 . 978-3-030-26950-0 . 51860634 . 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019 . Alexandra Boldyreva. Daniele Micciancio .
  8. Li . Yingxin . Liu . Fukang . Wang . Gaoli . Automating Collision Attacks on RIPEMD-160 . IACR Transactions on Symmetric Cryptology . 2023 . 4 . 2023-12-08 . 2519-173X . 10.46586/tosc.v2023.i4.112-142 . 112–142. free .