Separable Hash Functions

Sarang Aravamuthan

Paper 2010/253 Original: eprint.iacr.org/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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2010-05-04: last updated; 2010-05-04: published
Short URL: https://ia.cr/2010/253
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2010/253,
      author = {Sarang Aravamuthan},
      title = {Separable Hash Functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/253},
      year = {2010},
      url = {https://eprint.iacr.org/2010/253}
}