Results 1 
5 of
5
Constructing cryptographic hash functions from fixedkey blockciphers. Full version of this paper
, 2008
"... Abstract. We propose a family of compression functions built from fixedkey blockciphers and investigate their collision and preimage security in the idealcipher model. The constructions have security approaching and in many cases equaling the security upper bounds found in previous work of the aut ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
Abstract. We propose a family of compression functions built from fixedkey blockciphers and investigate their collision and preimage security in the idealcipher model. The constructions have security approaching and in many cases equaling the security upper bounds found in previous work of the authors [24]. In particular, we describe a 2nbit to nbit compression function using three nbit permutation calls that has collision security N 0.5,whereN =2 n, and we describe 3nbit to 2nbit compression functions using five and six permutation calls and having collision security of at least N 0.55 and N 0.63. Key words: blockcipherbased hashing, collisionresistant hashing, compression functions, cryptographic hash functions, idealcipher model. 1
The MD6 hash function A proposal to NIST for SHA3
, 2008
"... This report describes and analyzes the MD6 hash function and is part of our submission package for MD6 as an entry in the NIST SHA3 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 desir ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This report describes and analyzes the MD6 hash function and is part of our submission package for MD6 as an entry in the NIST SHA3 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
Multicollision Attacks on Generalized Hash Functions
, 2004
"... In a recent paper in crypto04, A. Joux [6] showed a multicollision attacks on the classical iterated hash function. He also showed how the multicollision attack can be used to get a collision attack on the concatenated hash function. In this paper we have shown that the multicollision attacks e ..."
Abstract
 Add to MetaCart
In a recent paper in crypto04, A. Joux [6] showed a multicollision attacks on the classical iterated hash function. He also showed how the multicollision attack can be used to get a collision attack on the concatenated hash function. In this paper we have shown that the multicollision attacks exist in a general class of sequential or tree based hash functions even if message blocks are used twice unlike the classical hash function.
Computing Science Group A new bound for lwise almost universal hash functions
"... Abstract. Using the pigeonhole principle, we derive a new bound for the key length in a lwise almost universal hash function where the multicollision or lcollision probability is bounded above by ɛ ∈ [0, 1]. The important features of this bound are (1) it decreases very slowly as l increases, and ..."
Abstract
 Add to MetaCart
Abstract. Using the pigeonhole principle, we derive a new bound for the key length in a lwise almost universal hash function where the multicollision or lcollision probability is bounded above by ɛ ∈ [0, 1]. The important features of this bound are (1) it decreases very slowly as l increases, and (2) the key length grows at least linearly with the logarithm of the message length. To our knowledge, this is the first almost universal hash bound for any integer l ≥ 2. This work arises from the use of lwise almost universal hash functions in manual authentication protocols. 1
A new bound for lwise almost universal hash functions
"... Abstract. Using the pigeonhole principle, we derive a new bound for the key length in a lwise almost universal hash function where the multicollision or lcollision probability is bounded above by ɛ ∈ [0, 1]. The important features of this bound are (1) it decreases very slowly as l increases, and ..."
Abstract
 Add to MetaCart
Abstract. Using the pigeonhole principle, we derive a new bound for the key length in a lwise almost universal hash function where the multicollision or lcollision probability is bounded above by ɛ ∈ [0, 1]. The important features of this bound are (1) it decreases very slowly as l increases, and (2) the key length grows at least linearly with the logarithm of the message length. To our knowledge, this is the first almost universal hash bound for any integer l ≥ 2. This work arises from the use of lwise almost universal hash functions in manual authentication protocols. 1