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

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

Documents Related by Co-Citation

295 A design principle for hash functions – I Damgard - 1989
483 Keying hash functions for message authentication – Mihir Bellare, Ran Canetti, Hugo Krawczyk - 1996
1360 Random Oracles are Practical: A Paradigm for Designing Efficient Protocols – Mihir Bellare, Phillip Rogaway - 1995
836 The MD5 Message-Digest Algorithm – R Rivest - 1992
1460 Security Architecture for the Internet Protocol – Randall Atkinson - 1995
1797 Key words for use in RFCs to Indicate Requirement Levels – S Bradner - 1997
522 Identification of endogenous social effects: The reflection problem – C F Manski - 1993
46 Formal Aspects of Mobile Code Security – R D Dean - 1999
316 Universal One-Way Hash Functions and their Cryptographic Applications – Moni Naor, Moti Yung - 1989