Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
By Antoine Joux. Annual International Cryptology Conference, 2004
457 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/8d767e5daee98ba1879b8c8e66299b0e22c4fd95
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Joan Daemen
- Guido Marco Bertoni
- Gilles Van Assche
- Stefan Lucks
- Michaël Peeters
- Jon Callas
- Michael Naehrig
- Patrick Longa
In Computer Vision and Pattern Recognition
- Joan Daemen
- Guido Marco Bertoni
- Gilles Van Assche
- Stefan Lucks
- Michaël Peeters
- Jon Callas
- Michael Naehrig
- Patrick Longa
Citations in the corpus
- The Skein Hash Function Family (2009, background): “In a more general context, Joux [44] used the same property to create huge multi-collisions very cheaply: a 2k-collision just needs time k · 2n/2.”
- On the Indifferentiability of the Sponge Construction (2008, background): “One may ask the question: what does this say about resistance to classical attacks such as collision-resistance, including multicollisions [9], (2nd) preimage resistance, including long-message attacks [10] and herding [11]? In general, it is expected that a hash function offers the same resistance ”