International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Separable Hash Functions

Authors:
Sarang Aravamuthan
Download:
URL: http://eprint.iacr.org/2010/253
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2010-23154,
  title={Separable Hash Functions},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / hash functions, separability, algebraic codes},
  url={http://eprint.iacr.org/2010/253},
  note={ sarang.aravamuthan@tcs.com 14732 received 3 May 2010},
  author={Sarang Aravamuthan},
  year=2010
}