Security Reductions of the Second Round SHA-3 Candidates

15 years 20 days ago

Download eprint.iacr.org

In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities identified in existing hash

Elena Andreeva, Bart Mennink, Bart Preneel

Real-time Traffic

Cryptographic Hash Algorithm | Information Technology | ISW 2010 | National Institute | Vulnerabilities |

claim paper

» Structural Attacks on Two SHA3 Candidates Blendern and DCHn

» Cryptanalysis of the Compression Function of SIMD

» Really Fast SyndromeBased Hashing

» Pseudocryptanalysis of the Original Blue Midnight Wish

» Second Preimage Attack on SHAMATA512

» Distinguishers for the Compression Function and Output Transformation of Hamsi256

» NearCollisions on the ReducedRound Compression Functions of Skein and BLAKE

» Practical Pseudocollisions for Hash Functions ARIRANG224384

Post Info
More Details (n/a)

Added	13 Feb 2011
Updated	13 Feb 2011
Type	Journal
Year	2010
Where	ISW
Authors	Elena Andreeva, Bart Mennink, Bart Preneel

Comments (0)

Sciweavers

Security Reductions of the Second Round SHA-3 Candidates

Cryptographic Hash Algorithm | Information Technology | ISW 2010 | National Institute | Vulnerabilities |

Explore & Download

Productivity Tools

Sciweavers