Cryptology ePrint Archive: Report 2010/253

Separable Hash Functions

Sarang Aravamuthan

Abstract: We introduce a class of hash functions with the property that messages with the same hash are well separated in terms of their Hamming distance. We provide an example of such a function that uses cyclic codes and an elliptic curve group over a finite field. \smallskip

A related problem is ensuring that the {\it consecutive distance} between messages with the same hash is as large as possible. We derive bounds on the c.d. separability factor of such hash functions.

Category / Keywords: cryptographic protocols / hash functions, separability, algebraic codes

Date: received 3 May 2010

Contact author: sarang aravamuthan at tcs com

Available format(s): PDF | BibTeX Citation

Version: 20100504:144801 (All versions of this report)

Short URL: ia.cr/2010/253

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]