Improved Weil and Tate pairings for elliptic and hyperelliptic curves

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

Volumn 3076, Issue , 2004, Pages 169-183

  Eisenträger, Kirsten ^a   Lauter, Kristin ^b   Montgomery, Peter L ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GEOMETRY; NUMBER THEORY; PUBLIC KEY CRYPTOGRAPHY;

BASE POINTS; CANCELLATION TECHNIQUES; ELLIPTIC CURVE; HYPER-ELLIPTIC CURVES; RANDOM CHOICE; STANDARD ALGORITHMS; TATE PAIRING; WEIL PAIRING;

ALGORITHMS;

EID: 35048886487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24847-7_12     Document Type: Article

References (11)

1. Paulo S.L.M. Barreto, Hae Y. Kim, Ben Lynn, and Michael Scott. Efficient algorithms for pairing-based cryptosystems. In M. Yung, editor, Advances in Cryptology - Crypto 2002, pages 354-368. LNCS 2442, Springer-Verlag, 2002.
2. Paulo S.L.M. Barreto, Ben Lynn, and Michael Scott. On the Selection of Pairing-Friendly Groups. In: M. Matsui and R. Zuccherato, editors, Selected Areas in Cryptography - SAC 2003, LNCS 3006, Springer-Verlag, 2004.
3. Dan Boneh and Matthew Franklin. Identity-based encryption from the Weil pairing. SIAM J. Comput., 32(3):586-615 (electronic), 2003.
4. David G. Cantor. Computing in the Jacobian of a hyperelliptic curve. Math. Comp., 48(177):95-101, 1987.
5. p - x + d. Advances in Cryptology - Asiacrypt 2003, pages 111-123, LNCS 2894, Springer-Verlag, 2003.
6. Kirsten Eisenträger, Kristin Lauter, and Peter L. Montgomery. Fast elliptic curve arithmetic and improved Weil pairing evaluation. In Marc Joye, editor, Topics in Cryptology - CT-RSA 2003, The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings, pages 343-354, LNCS 2612, Springer-Verlag, 2003.
7. Gerhard Frey and Hans-Georg 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.
8. Steven Galbraith, Keith Harrison, and David Soldera. Implementing the Tate Pairing. In Claus Fieker and David R. Kohel, editors, Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, pages 324-337. LNCS 2369, Springer-Verlag, 2002.
9. Antoine Joux. The Weil and Tate pairings as building blocks for public key cryptosystems (survey). In Claus Fieker and David R. Kohel, editors, Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, pages 20-32. LNCS 2369, Springer-Verlag, 2002.
10. Victor S. Miller. Short programs for functions on curves. Unpublished manuscript, 1986.
11. Joseph Silverman. The Arithmetic of Elliptic Curves. GTM 106, Springer-Verlag, 1986.