Cryptography and Coding

DOI10.1007/11586821zbMath1122.94042OpenAlexW2619930404MaRDI QIDQ5897515

Vincent Rijmen, Christian Rechberger, Norbert Pramstaller

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11586821

zbMATH Keywords

cryptanalysiscollisionhash functionLinear codeSHA-1low-weight vector

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Classification of disturbance vectors for collision attack in SHA-1 ⋮ Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Cryptanalysis of the Tiger Hash Function ⋮ Attacking Reduced Round SHA-256 ⋮ Practical collisions for EnRUPT ⋮ Classification and generation of disturbance vectors for collision attacks against SHA-1 ⋮ Collisions of SHA-0 and Reduced SHA-1 ⋮ Collisions for 70-Step SHA-1: On the Full Cost of Collision Search ⋮ Optimal Covering Codes for Finding Near-Collisions

This page was built for publication: Cryptography and Coding