Cryptology ePrint Archive: Report 2009/340

Efficient Indifferentiable Hashing into Ordinary Elliptic Curves

Eric Brier and Jean-Sebastien Coron and Thomas Icart and David Madore and Hugues Randriam and Mehdi Tibouchi

Abstract: We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic encoding from Crypto 2009. While almost as efficient as Icart's encoding, this hash function can be plugged into any cryptosystem that requires hashing into elliptic curves, while not compromising proofs of security in the random oracle model.

We also describe a more general (but less efficient) construction that works for a large class of encodings into elliptic curves, for example the Shallue-Woestijne-Ulas (SWU) algorithm. Finally we describe the first deterministic encoding algorithm into elliptic curves in characteristic 3.

Category / Keywords: public-key cryptography / Random Oracle Model, Elliptic Curve Cryptography

Publication Info: An extended abstract will appear at CRYPTO 2010. This is the full version.

Date: received 10 Jul 2009, last revised 3 Jun 2014

Contact author: jscoron at gmail com

Available format(s): PDF | BibTeX Citation

Note: Added: - proof of indifferentiability for f(h1(m))+f(h2(m)) - hash algorithms in characteristic 3

Version: 20140603:131830 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]