Cryptology ePrint Archive: Report 2006/477

Dynamic Cryptographic Hash Functions

William R. Speirs II and Samuel S. Wagstaff, Jr.

Abstract: We present the dynamic cryptographic hash function, a new type of hash function which takes two parameters instead of one. The additional parameter, the security parameter, specifies the internal workings and size of the digest produced. We provide a formal definitions for a dynamic cryptographic hash function and for the traditional security properties, modified for dynamic hash functions. Two additional properties, security parameter collision resistance and digest resistance, are also defined. The additional properties are motivated by scenarios where a dynamic hash functions more cleanly provides a solution to a typical cryptographic problem.

Category / Keywords: foundations / Hash function, dynamic, preimage resistance, collision resistance

Date: received 19 Dec 2006, last revised 21 May 2007

Contact author: bill speirs at gmail com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: Updates to the definitions.

Version: 20070521:232906 (All versions of this report)

Short URL: ia.cr/2006/477

Discussion forum: Show discussion | Start new discussion