Highly Influential

@article{Aravamuthan2010SeparableHF, title={Separable Hash Functions}, author={Sarang Aravamuthan}, journal={IACR Cryptology ePrint Archive}, year={2010}, volume={2010}, pages={253} }

- Published 2010 in IACR Cryptology ePrint Archive

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. A related problem is ensuring that the consecutive distance between messages with the same hash is as… CONTINUE READING

### Presentations referencing similar topics