Welcome to the resource topic for 2009/340
Title:
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
Authors: Eric Brier, Jean-Sebastien Coron, Thomas Icart, David Madore, Hugues Randriam, 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.
ePrint: https://eprint.iacr.org/2009/340
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .