Second preimages on n-bit hash functions for much less than 2^n work

by John Kelsey , Bruce Schneier
Citations:23 - 3 self

Documents Related by Co-Citation

312 A Design Principle for Hash Functions – I Damgård - 1989
1425 Random Oracles are Practical: A Paradigm for Designing Efficient Protocols – Mihir Bellare, Phillip Rogaway - 1995
2724 Handbook of Applied Cryptography – Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest - 1997
503 Keying hash functions for message authentication – Mihir Bellare, Ran Canetti, Hugo Krawczyk - 1996
2089 The Theory of Error-Correcting Codes – F MacWilliams, N Sloane - 1977
806 Differential Power Analysis – Paul Kocher, Joshua Jaffe, Benjamin Jun - 1999
1840 Key words for use in RFCs to Indicate Requirement Levels – S Bradner - 1997
702 Identification of Endogenous Social Effects: The Reflection Problem – Charles Manski
483 Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems – Paul C. Kocher - 1996