Topics in Cryptology – CT-RSA 2005
From MaRDI portal
Publication:5710850
DOI10.1007/b105222zbMath1079.94571OpenAlexW2476332689MaRDI QIDQ5710850
Vincent Rijmen, Elisabeth Oswald
Publication date: 8 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105222
Related Items (13)
Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes ⋮ Classification of disturbance vectors for collision attack in SHA-1 ⋮ Does Secure Time-Stamping Imply Collision-Free Hash Functions? ⋮ 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 ⋮ Herding Hash Functions and the Nostradamus Attack ⋮ Cryptanalysis of SHA-0 and reduced SHA-1 ⋮ Collisions for 70-Step SHA-1: On the Full Cost of Collision Search ⋮ Rotational rebound attacks on reduced Skein ⋮ Boomerang Distinguisher for the SIMD-512 Compression Function ⋮ Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256
This page was built for publication: Topics in Cryptology – CT-RSA 2005
