The sum can be weaker than each part
From MaRDI portal
Publication:2948334
DOI10.1007/978-3-662-46800-5_14zbMATH Open1370.94526OpenAlexW2130369971MaRDI QIDQ2948334FDOQ2948334
Authors: Gaëtan Leurent, Lei Wang 
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01105129
Recommendations
- Generic attacks on hash combiners
- New attacks on the concatenation and XOR hash combiners
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- Hash combiners for second pre-image resistance, target collision resistance and pre-image resistance have long output
- Security-Amplifying Combiners for Collision-Resistant Hash Functions
Cited In (8)
- Title not available (Why is that?)
- Quantum attacks on hash constructions with low quantum random access memory
- Combiners for backdoored random oracles
- The whole can be very much less than the sum of its parts
- Functional graph revisited: updates on (second) preimage attacks on hash combiners
- New attacks on the concatenation and XOR hash combiners
- Improving generic attacks using exceptional functions
- Generic attacks on hash combiners
This page was built for publication: The sum can be weaker than each part
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948334)
