Paper 2010/037 Original: eprint.iacr.org/2010/037 ↗
Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves
Abstract
Let E be a non-supersingular elliptic curve over a finite field F_q. At CRYPTO 2009, Icart introduced a deterministic function F_q->E(F_q) which can be computed efficiently, and allowed him and Coron to define well-behaved hash functions with values in E(F_q). Some properties of this function rely on a conjecture which was left as an open problem in Icart's paper. We prove this conjecture as well as analogues for other hash functions. See also Farahashi, Shparlinski and Voloch, _On Hashing into Elliptic Curves_, for independent results of a similar form.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2010-08-04: last updated
- 2010-01-26: published
- Short URL
- https://ia.cr/2010/037
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/037,
author = {Pierre-Alain Fouque and Mehdi Tibouchi},
title = {Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/037},
year = {2010},
url = {https://eprint.iacr.org/2010/037}
}