Constructing pairing-friendly genus 2 curves with ordinary Jacobians

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

Volumn 4575 LNCS, Issue , 2007, Pages 152-176

  Freeman, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELLIPTIC CURVES; EXPLICIT CONSTRUCTIONS; FINITE FIELDS; GENUS 2 CURVES; INTERNATIONAL CONFERENCES; JACOBIANS; PAIRING-BASED CRYPTOGRAPHY; PINCH METHOD;

CRYPTOGRAPHY;

EID: 50049117602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73489-5_9     Document Type: Conference Paper

References (31)

1. Balasubramanian, R., Koblitz, N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. Journal of Cryptology 11, 141-145 (1998)
2. Bernstein, D.: Elliptic vs. hyperelliptic, part 1. Talk at ECC 2006, Toronto, Canada (20 September 2006) Slides available at http://cr.yp.to/talks/ 2006.09.20/slides.pdf
3. Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325-341. Springer, Heidelberg (2005)
4. Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Designs, Codes and Cryptography 37, 133-141 (2005)
5. Cocks, C., Pinch, R.G.E.: Identity-based cryptosystems based on the Weil pairing (Unpublished manuscript 2001)
6. Eisenträger, K., Lauter, K.: A CRT algorithm for constructing genus 2 curves over finite fields. In: AGCT-11, 2007 (to appear), preprint available at http://arxiv.org/abs/math.NT/0405305
7. Freeman, D., Lauter, K.: Computing endomorphism rings of Jacobians of genus 2 curves over finite fields. In: Symposium on Algebraic Geometry and its Applications, Tahiti 2007 (to appear), preprint available at http://eprint.iacr.org
8. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Cryptology eprint,2006/371, available at http://eprint.iacr.org
9. Frey, G., Lange, T.: Fast bilinear maps from the Tate-Lichtenbaum pairing on hyperelliptic curves. In: Hess, F., Pauli, S., Pohst, M. (eels.) Algorithmic Number Theory. LNCS, vol. 4076, pp. 466-479. Springer, Heidelberg (2006)
10. Galbraith, S.: Supersingular curves in cryptography. In: Boyd, C (ed.) ASI-ACRYPT 2001. LNCS, vol. 2248, pp. 495-513. Springer, Heidelberg (2001)
11. Galbraith, S., McKee, J., Valença, P.: Ordinary abelian varieties having small embedding degree. Finite Fields and Their Applications (to appear), preprint available at http://eprint.iacr.org
12. Gaudry, P., Houtmann, T., Kohel, D., Ritzenthaler, C., Weng, A.: The 2-adic CM method for genus 2 curves with application to cryptography. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 114-129. Springer, Heidelberg (2006)
13. Goren, E., Lauter, K.: Class invariants for quartic CM fields. Annales Inst. Fourier, preprint ( to appear), available at http://arxiv.org/abs/math/ 0404378
14. Hitt, L.: Families of genus 2 curves with small embedding degree. Cryptology eprint 2007/001, available at http://eprint.iacr.org
15. Hitt, L.: On the minimal embedding field. In: Pairing 2007 (to appear), preprint available at http://eprint.iacr.org
16. Howe, E.: Principally polarized ordinary abelian varieties over finite fields. Trans. Amer. Math. Soc. 347, 2361-2401 (1995)
17. Katz, N.: Serre-Tate local moduli. In: Surfaces algébriques (Sém, de géom, algébr. d'Orsay 1976-78), Springer Lect. Notes in Math., exposé V-bis, vol. 868, pp. 138-202 (1981)
18. Lange, T.: Elliptic vs. hyperelliptic, part 2, Talk at ECC 2006, Toronto, Canada (20 September, 2006), slides available at http://hyperelliptic.org/ tanja/vortraege/ECC_06.ps
19. Luca, F., Mireles, D., Shparlinski, I.: MOV attack in various subgroups on elliptic curves. Illinois J. Math. 48, 1041-1052 (2004)
20. Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory 39, 1639 1646 (1993)
21. Mestre, J.-F.: Construction de courbes de genre 2 à partir de leurs modules. In: Effective methods in algebraic geometry, Birkhäuser Progr. Math. vol. 94, pp. 313-334 (1991)
22. Milne, J.S.: Abelian varieties. In: Cornell, G., Silverman, J. (eds.) Arithmetic Geometry, pp. 103-150. Springer, Heidelberg (1986)
23. Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction, IEICE Transactions on Fundamentals E84-A, 1234-1243 (2001)
24. Oort, F., Ueno, K.: Principally polarized abelian varieties of dimension two or three are Jacobian varieties. J. Fac. Sci. Univ. Tokyo Sect. IA Math. 20, 377-381 (1973)
25. Paterson, K.: Cryptography from pairings. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Advances in Elliptic Curve Cryptography, pp. 215 251. Cambridge University Press, Cambridge (2005)
26. Rubin, K., Silverberg, A.: Supersingular abelian varieties in cryptology. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 336-353. Springer, Heidelberg (2002)
27. Spallek, A.-M.: Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen. Ph.D. thesis, Institut für Experimentelle Mathematik, Universität GH Essen (1994)
28. Tate, J.: Classes d'isogénie des variétés abéliennes sur un corps fini (d'après T. Honda), Séminaire Bourbaki 1968/69, Springer Lect. Notes in Math. exposé 352, vol. 179, pp. 95-110 (1971)
29. van Wamelen, P.: Examples of genus two CM curves defined over the rationals. Math. Comp. 68, 307-320 (1999)
30. Waterhouse, W.C., Milne, J.S.: Abelian varieties over finite fields. Proc. Symp. Pure Math. 20, 53-64 (1971)
31. Weng, A.: Constructing hyperelliptic curves of genus 2 suitable for cryptography. Math. Comp. 72, 435-458 (2003)