How to Hash into Elliptic Curves

  • Thomas Icart
Conference paper

DOI: 10.1007/978-3-642-03356-8_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5677)
Cite this paper as:
Icart T. (2009) How to Hash into Elliptic Curves. In: Halevi S. (eds) Advances in Cryptology - CRYPTO 2009. Lecture Notes in Computer Science, vol 5677. Springer, Berlin, Heidelberg


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

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Thomas Icart
    • 1
  1. 1.Sagem SécuritéUniversité du LuxembourgLuxembourg

Personalised recommendations