How to Hash into Elliptic Curves

Thomas Icart

Paper 2009/226

How to Hash into Elliptic Curves

Thomas Icart

Abstract

We describe a new explicit function that given an elliptic curve $E$ defined over $\FF_{p^n}$, maps elements of $\FF_{p^n}$ into $E$ in \emph{deterministic} polynomial time and in a constant number of operations over $\FF_{p^n}$. The function requires to compute a cube root. As an application we show how to hash \emph{deterministically} into an elliptic curve.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. An extended abstract of this paper will appear at CRYPTO 2009. This is the full version.
Keywords: Elliptic curve Hash function
Contact author(s): thomas icart @ gmail com
History: 2009-05-30: received
Short URL: https://ia.cr/2009/226
License: CC BY

BibTeX

@misc{cryptoeprint:2009/226,
      author = {Thomas Icart},
      title = {How to Hash into Elliptic Curves},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/226},
      year = {2009},
      url = {https://eprint.iacr.org/2009/226}
}