Slide Attacks on a Class of Hash Functions
From MaRDI portal
Publication:3600370
DOI10.1007/978-3-540-89255-7_10zbMath1206.94067OpenAlexW1608254955MaRDI QIDQ3600370
Stefan Lucks, Thomas Peyrin, Michael Gorski
Publication date: 10 February 2009
Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_10
Related Items (4)
Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications ⋮ Efficient slide attacks ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ New slide attacks on almost self-similar ciphers
Cites Work
- Fast software encryption. 14th international workshop, FSE 2007, Luxembourg, Luxembourg, March 26--28, 2007. Revised selected papers
- Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
- New types of cryptanalytic attacks using related keys
- On the Security of Two MAC Algorithms
- Keying Hash Functions for Message Authentication
- Cryptanalysis of Grindahl
- Password Recovery on Challenge and Response: Impossible Differential Attack on Hash Function
- The Grindahl Hash Functions
- Improved Slide Attacks
- Herding Hash Functions and the Nostradamus Attack
- Cryptanalysis of Hash Functions with Structures
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Merkle-Damgård Revisited: How to Construct a Hash Function
- A Failure-Friendly Design Principle for Hash Functions
- On the Indifferentiability of the Sponge Construction
- Progress in Cryptology – Mycrypt 2005
- Fast Software Encryption
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Slide Attacks on a Class of Hash Functions
