How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
From MaRDI portal
Publication:3506390
DOI10.1007/978-3-540-68164-9_21zbMath1142.94329OpenAlexW1915515508MaRDI QIDQ3506390
Jean-Philippe Aumasson, Raphael C.-W. Phan
Publication date: 13 June 2008
Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68164-9_21
Related Items (1)
Uses Software
Cites Work
- Advances in cryptology -- EUROCRYPT 2005. 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22--26, 2005. Proceedings
- Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
- Advances in cryptology -- CRYPTO 2006. 26th annual international cryptology conference, Santa Barbara, California, USA, August 20--24, 2006. Proceedings
- Building a Collision-Resistant Compression Function from Non-compressing Primitives
- The Grindahl Hash Functions
- Herding Hash Functions and the Nostradamus Attack
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- Known-Key Distinguishers for Some Block Ciphers
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- RC4-Hash: A New Hash Function Based on RC4
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Second Preimage Attacks on Dithered Hash Functions
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
- Strengthening Digital Signatures Via Randomized Hashing
- One Way Hash Functions and DES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
