Efficiently computable endomorphisms for hyperelliptic curves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4076 LNCS, Issue , 2006, Pages 495-509

  Kohel, David R ^a   Smith, Benjamin A ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Efficiently computable endomorphisms; Hyperelliptic curve cryptography

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL METHODS; CRYPTOGRAPHY; NUMBER THEORY;

EFFICIENTLY COMPUTABLE ENDOMORPHISMS; HYPERELLIPTIC CURVE CRYPTOGRAPHY; HYPERELLIPTIC JACOBIANS; SCALAR MULTIPLICATION;

SECURITY OF DATA;

EID: 33746765632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11792086_35     Document Type: Conference Paper

References (21)

1. D. Cantor, Computing in the Jacobian of a hyperelliptic curve, Math. Camp., 48 (1987), 95-101.
2. M. Ciet, T. Lange, F. Sica, and J.-J. Quisquater, Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms, Advances in Cryptology - EUROCRYPT 2003, 387-400, LNCS 2656, Springer, Berlin, 2003.
3. p -x + 1 over a finite field of odd characteristic p. Coding theory, cryptography and related areas (Guanajuato, 1998), 73-89, Springer, Berlin, 2000.
4. J. Ellenberg, Endomorphism algebras of Jacobians. Advances in Mathematics 162 (2001), 243-271.
5. J. W. S. Cassels and E. V. Flynn, Prolegomena to a middlebrow arithmetic of curves of genus 2, London Mathematical Society Lecture Note Series 230, Cambridge University Press, Cambridge, 1996.
6. R. Gallant, R. Lambert, and S. Vanstone, Faster point multiplication on elliptic curves with efficient endomorphisms, Advances in Cryptology -CRYPTO 2001, 190-200, LNCS 2139, Springer, 2001.
7. P. Gaudry and N. Gürel, Counting points in medium characteristic using Kedlaya's algorithm, Experiment. Math. 12 (2003), no. 4, 395-402.
8. K.-I. Hashimoto, On Brumer's family of RM-curves of genus two. Tohoku Math. J. (2) 52, (2000), no. 4, 475-488.
9. K. Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology, J. Ramanujan Math. Soc. 16 (2001), no. 4, 323-338.
10. N. Koblitz, CM-curves with good cryptographic properties. Advances in Cryptology - CRYPTO '91, 279-287, LNCS 576, Springer, 1992.
11. T. Lange, Efficient arithmetic on hyperelliptic Koblitz curves, Ph.D. Thesis, 2001.
12. R. Lidl, G. L. Mullen and G. Turnwald, Dickson polynomials, Pitman monographs and surveys in pure and applied mathematics 65, Longman Scientific & Technical, 1993.
13. A. J. Menezes and S. A. Vanstone, The implementation of elliptic curve cryptosystems, Advances in Cryptology - Auscrypt 1990, 2-13, LNCS 453, Springer-Verlag, 1990.
14. J.-F. Mestre, Familles de courbes hyperelliptiques à multiplications réelles, Arithmetic algebraic geometry (Texel, 1989), 193-208, Progress in Math., 89, Birkhäuser Boston, Boston, MA, 1991.
15. Y.-H. Park, S. Jeong, J. Lim, Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms, Advances in cryptology -EUROCRYPT 2002 (Amsterdam), 197-208, LNCS 2332, Springer, 2002.
16. B. A. Smith, Explicit endomorphisms and correspondences, Ph.D. Thesis, The University of Sydney, 2005.
17. J. A. Solinas, Efficient arithmetic on Koblitz curves, Des. Codes Cryptogr, 19 (2000), no. 2-3, 195-249.
18. M. Stoll, Two simple 2-dimensional abelian varieties defined over Q with Mordell-Weil group of rank at least 19, C. R. Acad. Sci. Paris Sér. I Math. 321 (1995), no. 10, 1341-1345.
19. K. Takashima, A new type of fast endomorphisms on Jacobians of hyperelliptic curves and their cryptographic application. IEICE Trans. Fundamentals, E89-A (2006), no. 1, pp. 124-133.
20. W. Tautz, J. Top, A. Verberkmoes, Explicit hyperelliptic curves with real multiplication and permutation polynomials, Canad. J. Math., 43 (1991), no. 5, 1055-1064.
21. A. Weil, On some exponential sums, Proc. Nat. Acad. Sci., 34, (1948), 204-207.