International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Domain Extender for Collision Resistant Hash Functions: Improving Upon Merkle-Damgaard Iteration

Authors:
Palash Sarkar
Download:
URL: http://eprint.iacr.org/2003/173
Search ePrint
Search Google
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 \MD algorithm. Lastly, we describe the design of a new parallel hash algorithm.
BibTeX
@misc{eprint-2003-11887,
  title={Domain Extender for Collision Resistant Hash Functions: Improving Upon Merkle-Damgaard Iteration},
  booktitle={IACR Eprint archive},
  keywords={foundations / hash function, collision resistance, compression function, composition principle, directed acyclic graph},
  url={http://eprint.iacr.org/2003/173},
  note={ palash@isical.ac.in 13147 received 18 Aug 2003, last revised 29 Dec 2005},
  author={Palash Sarkar},
  year=2003
}