Ate pairing on hyperelliptic curves

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

Volumn 4515 LNCS, Issue , 2007, Pages 430-447

  Granger, R ^a   Hess, F ^b   Oyono, R ^c   Theriault N ^d   Vercauteren, F ^e,f  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c UNIVERSITY OF WATERLOO   (Canada)

^d UNIVERSIDAD DE TALCA   (Chile)

^e UNIVERSITY OF LEUVEN   (Belgium)

^f RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

Author keywords

Ate pairing; Finite fields; Hyperelliptic curves; Tate pairing

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; CURVE FITTING; FUNCTION EVALUATION; LINEAR ALGEBRA; THEOREM PROVING;

ATE PAIRING; FINITE FIELDS; HYPERELLIPTIC CURVES; TATE PAIRING;

CRYPTOGRAPHY;

EID: 38049150652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_25     Document Type: Conference Paper

References (25)

1. R. Avanzi. Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementation. In M. Joye and J.-J. Quisquater, editor, CHES, volume 3156 of Lecture Notes in Computer Science, pages 133-147. Springer, 2004.
2. R. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange, K. Nguyen, and F. Vercauteren. Handbook of elliptic and hyperelliptic curve cryptography. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, 2006.
3. R. Avanzi, N. Thériault, and Z. Wang. Rethinking low genus hyperelliptic jacobian arithmetic over binary fields: Interplay of field arithmetic and explicit formulae. Technical report, CACR, 2006. CACR 2006-07.
4. P. S. L. M. Barreto, S. Galbraith, C. O hEigeartaigh, and M. Scott. Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography, to be published, 2005.
5. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Moti Yung, editor, CRYPTO, volume 2442 of Lecture Notes in Computer Science, pages 354-368. Springer, 2002.
6. D. G. Cantor. Computing in the Jacobian of a hyperelliptic curve. Math. Comp., 48(177):95-101, 1987.
7. p- x + d. In C.-S. Laih, editor, ASIACRYPT, volume 2894 of Lecture Notes in Computer Science, pages 111-123. Springer, 2003.
8. G. Frey and T. Lange. Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves. In F. Hess, S. Pauli, M. Pohst, editors, ANTS VII, volume 4076 of Lecture Notes in Computer Science, pages 466-479. Springer, 2006.
9. G. Frey and H-G. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp., 62(206):865-874, 1994.
10. S. Galbraith, C. O hEigeartaigh, and C. Sheedy. Simplified pairing computation and security implications. To appear in J. Math. Crypt., 2007.
11. P. Gaudry, F. Hess and N. P. Smart. Constructive and Destructive Facets of Weil Descent on Elliptic Curves. J. Cryptology., 15(l):19-46, 2002.
12. P. Gaudry, E. Thome, N. Thériault and C. Diem. A double large prime variation for small genus hyperelliptic index calculus. Math. Comp., 76(257), 475-492, 2007.
13. R. Granger, D. Page, and N. Smart. High security pairing-based cryptography revisited. In F. Hess, S. Pauli, M. Pohst, editors, ANTS-VII, volume 4076 of Lecture Notes in Computer Science, pages 480-494. Springer, 2006.
14. C. Guyot, K. Kaveh, and V. M. Patankar. Explicit algorithm for the arithmetic on the hyperelliptic Jacobians of genus 3. J. Ramanujan Math. Soc., 19(2):75-115, 2004.
15. F. Hess. Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symb. Comp., 33(4):425-445, 2002.
16. F. Hess. A Note on the Tate Pairing of Curves over Finite Fields. Arch. Math., 82:28-32, 2004.
17. F. Hess, N. Smart, and F. Vercauteren. The Eta-pairing revisited. IEEE Transactions on Information Theory, 52(10):4595-4602, 2006.
18. T. Lange. Formulae for arithmetic on genus 2 hyperelliptic curves. Appl. Algebra Engrg. Comm. Comput., 15(5):295-328, 2005.
19. N. Koblitz and A. Menezes. Pairing-Based Cryptography at High Security Levels. In Nigel Smart, editor, IMA Int. Conf., volume 3796 of Lecture Notes in Computer Science, pages 13-36. Springer, 2005.
20. V. S. Miller. Short programs for functions on curves. Unpublished manuscript 1986. Available at http://crypto.stanford.edu/miller/miller.pdf.
21. V. S. Miller. The Weil pairing, and its efficient calculation. J. Cryptology, 17(4):235-261, 2004.
22. J. H. Silverman. The arithmetic of elliptic curves, volume 106 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1986.
23. H. Stichtenoth. Algebraic function fields and codes. Universitext. Springer-Verlag, Berlin, 1993.
24. E. Verheul. Evidence that XTR is more Secure than Supersingular Elliptic Curve Cryptosystems. In B. Pfitzmann, editor, EUROCRYPT, volume of 2045 Lecture Notes in Computer Science, pages 195-210. Springer, 2001.
25. N. Yui. On the Jacobian varieties of hyperelliptic curves over fields of characteristic p > 2. J. Algebra, 52(2):378-410, 1978.