Sciweavers

Share
PAIRING
2010
Springer

Deterministic Encoding and Hashing to Odd Hyperelliptic Curves

8 years 8 months ago
Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y2 = f(x) where f is an odd polynomial. Hyperelliptic curves of this type have been frequently considered in the literature to obtain Jacobians of good order and pairing-friendly curves. Our new encoding is nearly a bijection to the set of Fq-rational points on H. This makes it easy to construct well-behaved hash functions to the Jacobian J of H, as well as injective maps to J(Fq) which can be used to encode scalars for such applications as ElGamal encryption. The new encoding is already interesting in the genus 1 case, where it provides a well-behaved encoding to Joux’s supersingular elliptic curves.
Pierre-Alain Fouque, Mehdi Tibouchi
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where PAIRING
Authors Pierre-Alain Fouque, Mehdi Tibouchi
Comments (0)
books