Implementation of tate pairing on hyperelliptic curves of genus 2

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

Volumn 2971, Issue , 2004, Pages 97-111

  Choie, Youngju ^a   Lee, Eunjeong ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Elliptic curve cryptosystem; Hyperelliptic curve cryptosystem; Tate pairing implementation

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; GEOMETRY; SECURITY OF DATA;

ELLIPTIC CURVE CRYPTOSYSTEM; EXPLICIT FORMULA; FAST COMPUTATION; HYPER-ELLIPTIC CURVES; HYPERELLIPTIC CURVE CRYPTOSYSTEMS; PRIME FIELD; TATE PAIRING; TATE PAIRING IMPLEMENTATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 23944466280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24691-6_9     Document Type: Article

References (24)

1. D. Boneh and M. Franklin, Identity-based Encryption from the Weil paring, Advances in Cryptology-CRYPTO 2001, LNCS 2139, Springer-Verlag, (2001), pp.21-229, Springer-Verlag.
2. P. S.Barreto; H.Y.Kim, B. Lynn and M. Scott, Efficient Algorithms for Pairing-Based Cryptosystems, Cryptology eprint Archives, Available at http://eprint.iacr.org, (2002), Number 2002/008.
3. P. Barreto, B. Lynn and M. Scott, On the Selection of Pairing-Friendly Groups, Cryptology eprint Archives, Available at http://eprint.iacr.org, (2003), Number 2003/086.
4. D. G. Cantor, Computing in the Jacobian of a Hyperelliptic Curves, Math. Comp, 48, No.177 (1987), pp.95-101.
5. Y. Choie, E. Jeong and E. Lee, Supersingular Hyperelliptic Curves of Genus 2 over Finite Fields, Cryptology eprint Archives, Available at http://eprint.iacr.org, (2002), Number 2002/032.
6. I. Duursma and H. Lee, Tate-priring implementations for tripartite key agreement, Cryptology eprint Archives, Available at http://eprint.iacr.org, (2003), Number 2003/053.
7. G. Frey and H-G. Rück, A remark concerning m-divisibility in the divisor class group of curves, Math.Comp. 62, No.206 (1994), pp.865-874.
8. S. Galbraith, Supersingular curves in Cryptography, Advances in CryptologyAsiaCrypt'2001, LNCS 2248, Springer-Verlag, (2002), pp.495-513.
9. S. Galbraith, K. Harrison, and D. Soldera, Implementing the Tate pairing, ANTSV, LNCS 2369, Springer-Verlag, (2002), pp.324-337.
10. A. Joux, A one round protocol for tripartite Diffie-Hellman, ANTS-IV, LNCS 1838, Springer-Verlag, (2000), pp.385-393.
11. A. Karatsuba and Y. Ofman, Multiplication of Multidigit Numbers on Automata, Sov. Phys.-Dokl. (Engl. transl), 7, No. 7 (1963), pp.595-596.
12. N. Koblitz, Algebraic aspects of cryptography, Springer-Verlag (1998).
13. T. Lange, Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae, Cryptology eprint Archives, Available at http://eprint.iacr.org, (2002), Number 2002/121.
14. V. Miller, Short Programs for Functions on Curves, Unpublished manuscript, 1986.
15. Y. Miyamoto, H. Doi, K. Matsuo, J. Chao, and S. Tsuji, A fast addition algorithm of genus two hyperellipitc curve, In Proc. of SCIS2002, IEICE Japan, (2002), pp.497-502(in Japanese).
16. A.J. Menezes, T. Okamoto and S.AQ. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Thans. Inf. Theory, 39, No.5 (1993), pp.1639-1646.
17. D. Mumford, Tata Lectures on Theta II, Birkhauser, 1984.
18. K. G. Paterson, ID-based signature from pairings on elliptic curves, Electronis Letters, 38 No.18 (2002), pp.1025-1026.
19. J. Pelzl, T. Wollinger, J. Guajardo and C. Paar, Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves (Update), Cryptology eprint Archives, Available at http://eprint.iacr.org, (2003), Number 2003/026.
20. K. Rubin and A. Silverberg, The Best and Worst of Supersingular Abelian Varieties in Cryptology, Cryptology eprint Archives, Available at http://eprint.iacr.org, (2002), Number 2002/121.
21. R. Sakai and M. Kasahara, ID based Cryptosystems with Pairing on Elliptic Curve, Cryptology eprint Archives, Available at http://eprint.iacr.org, (2003), Number 2003/054.
22. N.P.Smart, On the Performance of Hyperelliptic Cryptosystems, Advances in Cryptology-Eurocrypt'99, LNCS 1592, Springer-Verlag, (1999), pp.165-175.
23. H. Stichtenoth, Algebraic Function Fields and Codes, Springer Verlag (1993).
24. E. R. Verheul, Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems,Advances in Cryptology-AsiaCrypt'2001, LNCS 2248, Springer-Verlag, (2002), pp.433-551.