Efficient Encodings to Hyperelliptic Curves over Finite Fields
Abstract
groups. In this case elliptic and hyperelliptic cryptosystems are more noticed because they provide
good security with smaller size keys. Since these systems were used for cryptography, it has
been an important issue to transform a random value in finite field into a random point on an
elliptic or hyperelliptic curve in a deterministic and efficient method. In this paper we propose
a deterministic encoding to hyperelliptic curves over finite field. For cryptographic desires it is
important to have an injective encoding. In finite fields with characteristic three we obtain an
injective encoding for genus two hyperelliptic curves.
Keywords
Full Text:
PDFReferences
L. Adleman, J. DeMarrais and M. Huang,A subexponential algorithm for discrete logarithms
over the rational subgroup of the jacobians of large genus hyperelliptic curves finite fields, Algorithmic
Number Theory, LNCS 877 1984, 28-40.
D. J. Bernstein, P. Birkner, T. Lange, C Peters, Twisted Edwards curves, in: S. Vaudenay (Ed.),
Progress in Cryptology - Africacrypt 2008, Lecture Notes in Comput. Sci. 5023, Springer-
Verlag, 2008, pp. 389-405.
Bernstein, D.J., Hamburg, M. and krosnova, A. and Lange,T., ”Elligator: Elliptic-curve points
indistinguishable from uniform random strings”, In: V. Gligor, M. Yung,(eds.)ACMCCS(2013)
Boneh, D., Franklin, K.: Identity-Based Encryption from the Weil Pairing, CRYPTO 2001,
LNCS, vol. 2139, pp. 213-229 Springer (2001).
Brier, E., Coron, J.S., Icart, T., Madore, D., Randriam, H. and Tibouchi, M., ”Efficient Indifferentiable
Hashing into Ordinary Elliptic Curves”, Advances in Cryptology CRYPTO 2010
Lecture Notes in Computer Science Volume 6223, 2010: 237-254.
Chevassut,O., Fouque, P.A., Gaudry, P. and Pointcheval, D., ”The twist-augmented technique for
key exchange”, Public Key Cryptography volume 3958 of Lecture Notes in Computer Science,
: 410-426.
Cohen, H., A course in computational algebraic number theory, volume 138 of Graduate Texts
in Mathematics. Springer-Verlag, Berlin, 1993.
Farashahi R.R. (2011) Hashing into Hessian Curves. In: Nitaj A., Pointcheval D. (eds) Progress
in Cryptology AFRICACRYPT 2011. AFRICACRYPT 2011. Lecture Notes in Computer Science,
vol 6737. Springer, Berlin, Heidelberg
Farashahi,R.R., Shparlinski, I.E. and Voloch,J.F., ”On hashing into elliptic curves”, J.Math.
Crypt. 3(10), 2009: 353-360.
Fouque, P.A., Joux, A. Tibouchi,M., ”Injective Encodings to Elliptic Curves”, Information
Security and Privacy, 2013: Volume 7959 of the series Lecture Notes in Computer Science pp
-218.
P.A. Fouque, M. Tibouchi, Deterministic Encoding and Hashing to Odd Hyperelliptic Curves.
In: Joye M., Miyaji A., Otsuka A. (eds) Pairing-Based Cryptography - Pairing 2010. Lecture
Notes in Computer Science, vol 6487. Springer, Berlin, Heidelberg
P. Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves, Advances
in Cryptology - Eurocrypt 2000, LNCS 1807, 19-34.
Icart,T., ”How to hash into elliptic curves”, CRYPTO, volume 5677 of Lecture Notes in Computer
Science, 2009: pages 303316. Springer.
Koblitz, N., ”Elliptic curve cryptosystems”, Math. Comp. 48, 1987: 203-209.
Menezes, A., Okamoto, T. and Vanstone, S.A., ”Reducing elliptic curve logarithms to logarithms
in a finite field”, IEEE Transactions on Information Theory, 39(5), 1993: 1639-1646.
Shallue, A., van de Woestijne, C., ”Construction of rational points on elliptic curves over finite
fields”, ANTS, volume 4076 of Lecture Notes in Computer Science, 2006: 510-524.
Silverman, J., Advanced Topics in the Arithmetic of Elliptic Curves, Grad. Texts in Math., vol.
, Springer, New York, 1994.
Ulas, M., ”Rational points on certain hyperelliptic curves over finite fields”, Bull. Polish Acad.
Sci. Math., 55(2), 2007: 97-104.
Refbacks
- There are currently no refbacks.
ISSN 0352-9665 (Print)