Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration.

Discrete Applied Mathematics (Impact Factor: 0.68). 01/2009; 157:1086-1097. DOI: 10.1016/j.dam.2008.03.038
Source: DBLP

ABSTRACT We study the problem of securely extending the domain of a collision resistant compression function. A new construction based on directed acyclic graphs is described. This generalizes the usual iterated hashing constructions. Our main contribution is to introduce a new technique for hashing arbitrary length strings. Combined with DAG based hashing, this technique gives a new hashing algorithm. The amount of padding and the number of invocations of the compression function required by the new algorithm is smaller than the general Merkle-Damgard algorithm. Lastly, we describe the design of a new parallel hash algorithm.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In a recent paper, A. Joux (7) showed multicollision attacks on the classical iterated hash function. (A multicollision is a set of inputs whose hash values are same.) He also showed how the multicollision attacks can be used to get a collision attack on the concatenated hash function. In this paper, we first try to fix the attack by introducing a natural and wide class hash functions. However, we show that the multicollision attacks also exist in this general class. Thus, we rule out a natural and a wide class of hash functions as candidates for multicollision secure hash functions.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: User authentication is an important security mechanism for recognizing legal remote users. We propose an available and secure authentication scheme for service provider to verify users without using verification table. It can resist most of the attacks by improving nonce-based mutual authentication mechanism, and ensure the security by dynamic session key. User may change his password freely. Our scheme compared with other related schemes for security efficiency.
    WSEAS Transactions on Computers 01/2009; 8(7):1041-1050.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Suffix-free padding ruels is the sufficient and necessary conditions to preserve the collision security for MD iterated hash functions. We provide a suffix-free length encoding padding rule to the iterated construction hash function to present an efficient new hash transform. The new padding rule requires no change in the internals of a hash function, runs as efficiently as the original, and as usual it is collision-resistance preserving. The padding rule is better than some known padding rules in terms of the padding size and the message space.


Available from