| Autor: |
Brier, Eric, Coron, Jean-Sébastien, Icart, Thomas, Madore, David, Randriam, Hugues, Tibouchi, Mehdi |
| Zdroj: |
Advances in Cryptology - CRYPTO 2010; 2010, p237-254, 18p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
