A Meet-in-the-Middle Collision Attack Against the New FORK-256

DOI10.1007/978-3-540-77026-8_2zbMath1153.94427OpenAlexW1517923646WikidataQ30053926 ScholiaQ30053926MaRDI QIDQ5458197

Markku-Juhani O. Saarinen

Publication date: 11 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77026-8_2

zbMATH Keywords

FORK-256Hash Function CryptanalysisMeet-in-the-middle Attack

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Constructing quantum hash functions based on quantum walks on Johnson graphs ⋮ Simple hash function using discrete-time quantum walks ⋮ (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach ⋮ Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others

Cites Work

• Parallel collision search with cryptanalytic applications
• Cryptanalysis of FORK-256
• A New Dedicated 256-Bit Hash Function: FORK-256
• Cryptanalysis of Reduced Variants of the FORK-256 Hash Function

This page was built for publication: A Meet-in-the-Middle Collision Attack Against the New FORK-256