RIPEMD-160: A strengthened version of RIPEMD

DOI10.1007/3-540-60865-6_44zbMath1373.94914MaRDI QIDQ4593785

Bart Preneel, Hans Dobbertin, Antoon Bosselaers

Publication date: 15 November 2017

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/234118

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Re-keying algorithms for symmetric cryptosystems, Collision Resistant Double-Length Hashing, Cryptanalysis of full \texttt{RIPEMD-128}, Revisiting structure graphs: applications to CBC-MAC and EMAC, Open problems in hash function security, New proofs for NMAC and HMAC: security without collision resistance, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, One-way hash functions with changeable parameters., Cryptanalysis of SHA-0 and reduced SHA-1, Hardened bloom filters, with an application to unobservability, Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD, Post-Quantum Cryptography: State of the Art, The NIST SHA-3 Competition: A Perspective on the Final Year, (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach, JERIM-320: a 320-bit hash function with dual applications–a statistical analysis, Fast Hashing on the Pentium, The Hash Function Family LAKE, Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others