Genus 2 hyperelliptic curve families with explicit Jacobian order evaluation and pairing-friendly constructions

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

Volumn 7708 LNCS, Issue , 2013, Pages 234-253

  Guillevic, Aurore ^a,b   Vergnaud, Damien ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b THALES COMMUNICATIONS   (France)

Author keywords

Brezing Weng method; Cocks pinch method; Genus 2; Hyperelliptic curves; Order computation; Ordinary curves; Pairing friendly constructions

Indexed keywords

EMBEDDINGS; FUNCTIONS; GEOMETRY; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY;

BREZING-WENG METHOD; GENUS 2; HYPER-ELLIPTIC CURVES; ORDINARY CURVES; PINCH METHOD;

CURVE FITTING;

EID: 84892424651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36334-4_16     Document Type: Conference Paper

References (39)

1. Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comput. 61, 29-68 (1993)
2. Balakrishnan, J., Belding, J., Chisholm, S., Eisenträger, K., Stange, K., Teske, E.: Pairings on hyperelliptic curves. In: WIN - Women in Numbers: Research Directions in Number Theory. Fields Institute Communications, vol. 60, pp. 87-120. Amer. Math. Soc., Providence (2011)
3. Benger, N., Charlemagne, M., Freeman, D.M.: On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields. In: Shacham, H.,Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 52-65. Springer, Heidelberg (2009)
4. Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586-615 (2003)
5. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptology 17(4), 297-319 (2004)
6. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4), 235-265 (1997);
7. Computational algebra and number theory, London (1993)
8. Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Cryptography 37(1), 133-141 (2005)
9. Certivox. MIRACL Crypto SDK (2012), http://certivox.com/index.php/ solutions/miracl-crypto-sdk/
10. Cocks, C., Pinch, R.G.: ID-based cryptosystems based on the Weil pairing (2001) (unpublished manuscript)
11. Dupont, R., Enge, A., Morain, F.: Building curves with arbitrary small mov degree over finite prime fields. J. Cryptology 18(2), 79-89 (2005)
12. Enge, A.: CM Software (February 2012), http://www.multiprecision.org/ index.php?prog=cm
13. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptology 23(2), 224-280 (2010)
14. Freeman, D., Stevenhagen, P., Streng, M.: Abelian Varieties with Prescribed Embedding Degree. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol. 5011, pp. 60-73. Springer, Heidelberg (2008)
15. Freeman, D.M., Satoh, T.: Constructing pairing-friendly hyperelliptic curves using weil restriction. J. Number Theory 131(5), 959-983 (2011)
16. Furukawa, E., Kawazoe, M., Takahashi, T.: Counting Points for Hyperelliptic Curves of Type y2 = x5+ax over Finite Prime Fields. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 26-41. Springer, Heidelberg (2004)
17. Galbraith, S.D.: Pairings. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol. 317, ch. 9. Cambridge Univ. Press (2004)
18. Galbraith, S.D., Hess, F., Vercauteren, F.: Hyperelliptic Pairings. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 108-131. Springer, Heidelberg (2007)
19. Galbraith, S.D., Pujolas, J., Ritzenthaler, C., Smith, B.: Distortion maps for supersingular genus two curves. J. Math. Crypt. 3(1), 1-18 (2009)
20. Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190-200. Springer, Heidelberg (2001)
21. Gaudry, P.: Fast genus 2 arithmetic based on theta functions. J. Math. Crypt. 1(3), 243-265 (2007)
22. Gaudry, P., Kohel, D., Smith, B.: Counting Points on Genus 2 Curves with Real Multiplication. In: Lee, D.H.,Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 504-519. Springer, Heidelberg (2011)
23. Gaudry, P., Schost, É.: On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 373-386. Springer, Heidelberg (2001)
24. Gaudry, P., Schost, É.: Genus 2 point counting over prime fields. J. Symb. Comput. 47(4), 368-400 (2012)
25. Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126-135. Springer, Heidelberg (2008)
26. Kachisa, E.J.: Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 312-326. Springer, Heidelberg (2010)
27. Kawazoe, M., Takahashi, T.: Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y2 = x5 +ax. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 164-177. Springer, Heidelberg (2008)
28. Koblitz, N.: Elliptic curve cryptosystems. Math. Comp. 48(177), 203-209 (1987)
29. Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptology 1, 139-150 (1989)
30. Konstantinou, E., Kontogeorgis, A., Stamatiou, Y., Zaroliagis, C.: On the efficient generation of prime-order elliptic curves. J. Cryptology 23, 477-503 (2010)
31. Konstantinou, E., Stamatiou, Y., Zaroliagis, C.: Efficient generation of secure elliptic curves. International Journal of Information Security 6, 47-63 (2007)
32. Lercier, R.: Algorithmique des courbes elliptiques dans les corps finis. PhD thesis, École Polytechnique (1997)
33. Lercier, R., Lubicz, D., Vercauteren, F.: Point counting on elliptic and hyperelliptic curves. In: Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F. (eds.) Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications, vol. 34, ch. 17, pp. 239-263. CRC Press, Boca Raton (2005)
34. Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417-426. Springer, Heidelberg (1986)
35. Satoh, T.: On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 43-66. Springer, Heidelberg (2002)
36. Satoh, T.: Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 536-553. Springer, Heidelberg (2009)
37. Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comput. 44, 483-494 (1998)
38. Scott, M.: MIRACL library (August 2011), http://www.shamus.ie
39. Takashima, K.: A new type of fast endomorphisms on jacobians of hyperelliptic curves and their cryptographic application. IEICE Transactions 89-A(1), 124-133 (2006)