Near-collisions for the reduced round versions of some second round SHA-3 compression functions using hill climbing

DOI10.1007/978-3-642-17401-8_11MaRDI QIDQ3058720zbMATH OpenOpenAlexFDO

Authors Meltem Sönmez Turan, Erdener Uyan

Publication date 7 December 2010

Published in Progress in Cryptology - INDOCRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17401-8_11

zbMATH Keywords

hash functionsnear-collisionsSHA-3 competition

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Near-collisions on the reduced-round compression functions of Skein and BLAKE
• Advances in Cryptology – CRYPTO 2004
• Memoryless near-collisions via coding theory
• Practical near-collisions on the compression function of BMW
• Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function

Cited in

(6)

• Practical Analysis of Reduced-Round Keccak
• Near-collisions on the reduced-round compression functions of Skein and BLAKE
• Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
• Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512
• Practical near-collisions on the compression function of BMW
• Memoryless near-collisions, revisited

This page was built for publication: Near-collisions for the reduced round versions of some second round SHA-3 compression functions using hill climbing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058720)