The MD6 hash function A proposal to NIST for SHA-3

The MD6 hash function A proposal to NIST for SHA-3 (2008)

Cached

Download Links

by Ronald L. Rivest , Benjamin Agre , Daniel V. Bailey , Christopher Crutchfield , Yevgeniy Dodis , Kermin Elliott , Fleming Asif Khan , Jayant Krishnamurthy , Yuncheng Lin , Leo Reyzin , Emily Shen , Jim Sukha , Drew Sutherland , Eran Tromer , Yiqun Lisa Yin

Citations:

1 - 1 self

BibTeX

@MISC{Rivest08themd6,
    author = {Ronald L. Rivest and Benjamin Agre and Daniel V. Bailey and Christopher Crutchfield and Yevgeniy Dodis and Kermin Elliott and Fleming Asif Khan and Jayant Krishnamurthy and Yuncheng Lin and Leo Reyzin and Emily Shen and Jim Sukha and Drew Sutherland and Eran Tromer and Yiqun Lisa Yin},
    title = {The MD6 hash function A proposal to NIST for SHA-3},
    year = {2008}
}

Bookmark

OpenURL

Abstract

This report describes and analyzes the MD6 hash function and is part of our submission package for MD6 as an entry in the NIST SHA-3 hash function competition 1. Significant features of MD6 include: • Accepts input messages of any length up to 2 64 − 1 bits, and produces message digests of any desired size from 1 to 512 bits, inclusive, including

Citations

2057	Handbook of Applied Cryptography - Menezes, Oorschot, et al. - 1997
1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
706	A.: How to prove yourself: Practical solutions to identification and signature problems - Fiat, Shamir - 1986
544	How to construct random functions - Goldreich, Goldwasser, et al. - 1986
407	Differential Cryptanalysis of DES-like Cryptosystems - Biham, Shamir - 1990
404	Keying hash functions for message authentication - Bellare, Canetti, et al. - 1996
359	Linear Cryptanalysis Method for DES Cipher - Matsui
163	The security of the cipher block chaining message authentication code - Bellare, Kilian, et al.
150	How to break MD5 and other hash functions - Wang, Yu - 2005
138	One way hash functions and DES - Merkle
123	Remote Timing Attacks Are Practical - Brumley, Boneh - 2003
123	Random Number Generation - L'Ecuyer
123	H.: Finding collisions in the full SHA-1 - Wang, Yin, et al. - 2005
109	XOR MACs: New methods for message authentication using finite pseudorandom functions - Bellare, Guérin, et al. - 1995
80	Towards realizing random oracles: Hash functions that hide all partial information - Canetti - 1997
78	An analysis of the blockcipher-based hash functions from PGV - Black, Rogaway, et al.
65	Mdx-mac and building fast macs from hash functions - Preneel, Oorschot - 1995
57	The design of Rijndael : AES–the Advanced Encryption Standard - Daemen, Rijmen - 2002
56	Hash functions based on block ciphers: A synthetic approach - Preneel, Govaerts, et al. - 1993
55	Cache-timing attacks on AES - Bernstein - 2005
55	Cache attacks and countermeasures: The case of aes - Osvik, Shamir, et al. - 2006
49	Near-Collisions of SHA-0 - Biham, Chen - 2004
47	public key systems - Merkle, authentication - 1979
46	On the cryptographic applications of random functions - Goldreich, Goldwasser, et al. - 1985
45	Efficient Collision Search Attacks on SHA-0 - Wang, Yin, et al. - 2005
44	Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology - Maurer, Renner, et al. - 2004
37	Differential collisions in sha-0 - Chabaud, Joux - 1998
36	Cache missing for fun & profit - Percival - 2005
34	Kathirgamar Aingaran, Kunle Olukotun. Niagara: A 32-Way Multithreaded Sparc Processor - Kongetira
34	A failure-friendly design principle for hash functions - Lucks - 2005
29	Message authentication with md5 - Kaliski, Robshaw - 1995
27	Predicting secret keys via branch prediction - Acıiçmez, Koç, et al. - 2007
27	Yevgeniy Dodis, Cécile Malinaud, and Prashant Puniya. Merkle-Damgård Revisited: How to Construct a Hash Function - Coron - 2005
27	Preimages on n-Bit Hash Functions for Much Less than 2 n Work - Second
27	On the security of two MAC Algorithms - Preneel, Oorschot
26	Generators for Certain Alternating Groups with Applications to Cryptography - Coppersmith, Grossman - 1975
26	Design Principles for Iterated Hash Functions. Cryptology ePrint Archive, Report 2004/253, 2004. http://eprint.iacr.org. 8. Stefan Lucks. A Failure-Friendly Design Principle for Hash Functions - Lucks
25	Xorshift RNGs - Marsaglia - 2003
24	C.: Finding SHA-1 characteristics: General results and applications - Cannière, Rechberger
22	A framework for iterative hash functions - Biham, Dunkelman - 2006
22	CryptoGraphics: Secret Key Cryptography Using Graphics Cards - Cook, Ioannidis, et al. - 2005
22	Cryptanalysis of the hash functions MD4 and RIPEMD - Wang, Lai, et al. - 2005
21	Assche. On the indifferentiability of the sponge construction - Bertoni, Daemen, et al. - 2008
21	Black box cryptanalysis of hash networks based on multipermutations - Schnorr, Vaudenay - 1995
20	Indistinguishability of random systems - Maurer - 2002
19	On the impossibility of highly-efficient blockcipher-based hash functions - Black, Cochran, et al. - 2005
18	Fast constructive recognition of a black box group isomorphic to Sn or An using Goldbach’s conjecture - Bratus, Pak
17	Formalizing human ignorance: Collision-resistant hashing without the keys - Rogaway - 2006
15	Chosen IV Statistical Analysis for Key Recovery Attacks on Stream Ciphers - Fischer, Khazaei, et al. - 2008
15	Practical symmetric key cryptography on modern graphics hardware - Harrison, Waldron - 2008