Encyclopedia of Cryptography and Security

2011 Edition
| Editors: Henk C. A. van Tilborg, Sushil Jajodia

RIPEMD Family

  • Antoon Bosselaers
Reference work entry
DOI: https://doi.org/10.1007/978-1-4419-5906-5_612

Related Concepts

 Collision Resistance;  Hash Functions;  Preimage Resistance;  Second Preimage Resistance

The RIPEMD Family designates a family of five different  Hash Functions: RIPEMD, RIPEMD-128, RIPEMD-160, RIPEMD-256, and RIPEMD-320 [12]. They take variable length input messages and hash them to fixed-length outputs. They all operate on 512-bit message blocks divided into sixteen 32-bit words. RIPEMD (later replaced by RIPEMD-128/160) and RIPEMD-128 produce a hash value of 128 bits, RIPEMD-160, RIPEMD-256, and RIPEMD-320 have a hash result of 160, 256, and 320 bits, respectively. All the five functions start by padding the message according to the so-called Merkle–Damgård strengthening technique (refer to  Hash Functionsfor more details). Next, the message is processed block by block by the underlying compression function. This function initializes an appropriate number of 32-bit chaining variables to a fixed value to hash the first message block, and to the intermediate...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    RIPE (1995) Integrity primitives for secure information systems. In: Bosselaers A, Preneel B (eds) Final Report of RACE Integrity Primitives Evaluation (RIPE-RACE 1040). Lecture notes in computer science, vol 1007. Springer, BerlinGoogle Scholar
  2. 2.
    Dobbertin H, Bosselaers A, Preneel B (1996) RIPEMD-160: a strengthened version of RIPEMD. In: Gollmann D (ed) Fast Software Encryption, Cambridge, UK, 21–23 February 1996. Lecture notes in computer science, vol 1039. Springer, Berlin, pp 71–82. Final version available at http://www.esat.kuleuven.ac.be/~cosicart/pdf/AB-9601/. More information on all aspects of RIPEMD-xxx can be found at http://www.esat.kuleuven.ac.be/~bosselae/ripemd160/
  3. 3.
    Dobbertin H (1992) RIPEMD with two-round compress function is not collisionfree. J Cryptol 10(1):51–69Google Scholar
  4. 4.
    van Oorschot PC, Wiener M (1999) Parallel collision search with cryptanalytic applications. J Cryptol 12(1):1–28MATHGoogle Scholar
  5. 5.
    ISO/IEC 10118-3 (2003) Information technology—security techniques—hash-functions—Part 3: Dedicated hash-functionsGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Antoon Bosselaers
    • 1
  1. 1.Department of Electrical EngineeringKatholieke Universiteit LeuvenLeuven-HeverleeBelgium