Tate pairing computation on the divisors of hyperelliptic curves of genus 2

다국어 초록 (Multilingual Abstract)

We present an explicit Eta pairing approach for computing the Tate pairing on general divisors of hyperelliptic curves Hd of genus 2, where Hd : y² + y = x5 + x³ + d is defined over F₂n with d = 0 or 1. We use the resultant for computing the Eta pairing on general divisors. Our method is very general in the sense that it can be used for general divisors, not only for degenerate divisors. In the pairing-based cryptography, the efficient pairing implementation on general divisors is significantly important because the decryption process definitely requires computing a pairing of general divisors.

참고문헌 (Reference)

1 K. Rubin, "Using Abelian Varieties to Improve Pairing-Based Cryptography"

2 J. Silverman, "The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics" Springer-Verlag 106-, 1986

3 I. Duursma, "Tate pairing implementation for hyperelliptic curves y2 = xp ¡ x + d, Advances in cryptology—ASIACRYPT 2003" Springer 2894 : 111-123, 2003

4 D. Mumford, "Tata Lectures on Theta. II, Jacobian theta functions and differential equations In: Progress in Mathematics" Birkhauser Boston, Inc. 43-, 1984

5 S. Galbraith, "Supersingular curves in cryptography, Advances in cryptology—ASIACRYPT 2001 (Gold Coast)" Springer 2248 : 495-513, 2001

6 D. Boneh, "Short signatures from the Weil pairing, Advances in cryptology—ASIACRYPT 2001 (Gold Coast)" Springer 2248 : 514-532, 2001

7 A. J. Menezes, "Reducing elliptic curve logarithms to logarithms in a finite field" 39 (39): 1639-1646, 1993

8 N. Koblitz, "Pairing-based cryptography at high security levels, Cryptography and coding" Springer 3796 : 13-36, 2005

9 P. S. L. M. Barreto, "On the selection of pairing-friendly groups, Selected areas in cryptography" Springer 3006 : 17-25, 2004

10 M. Katagi, "Novel efficient implementations of hyperelliptic curve cryptosystems using degenerate divisors, In Information Security Applications-WISA’2004" Springer 3325 : 345-359, 2005

11 S. Galbraith, "Implementing the Tate pairing, Algorithmic number theory (Sydney, 2002)" Springer 2369 : 324-337, 2002

12 Y. Choie, "Implementation of Tate pairing on hyperelliptic curves of genus 2, Information security and cryptology—ICISC 2003" Springer 2971 : 97-111, 2004

13 D. Boneh, "Identity-based encryption from the Weil pairing" 32 (32): 586-615, 2003

14 L. Chen, "Identity Based Authenticated Key Agreement Protocols from Pairings" Cryptology eprint Archives 184-, 2002

15 A.Weimerskirch, "Generic GF(2m) arithmetic in software and its application to ECC, Proceedings of ACISP 2003" Springer 2727 : 79-92, 2003

16 C. K. Yap, "Fundamental Problems of Algorithmic Algebra" Oxford University Press 2000

17 E. R. Verheul, "Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, Advances in cryptology—EUROCRYPT 2001 (Innsbruck)" Springer 2045 : 195-210, 2001

18 P. S. L. M. Barreto, "Efficient algorithms for pairingbased cryptosystems, Advances in cryptology—CRYPTO 2002" Springer 2442 : 354-368, 2002

19 M. Scott, "Compressed pairings, Advances in cryptology—CRYPTO 2004" Springer 3152 : 140-156, 2004

20 P. S. L. M. Barreto, "C. O’hEigeartaigh, and M. Scott, Efficient pairing computation on supersingular abelian varieties" 42 (42): 239-271, 2007

21 R. Granger, "Ate pairing on hyperelliptic curves, Proceedings of Euro 2007" Springer 4515 : 430-447, 2007

22 N. Koblitz, "Algebraic Aspects of Cryptography In: Algorithms and Computation in Mathematics" Springer-Verlag 1998

23 G. Frey, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves" 62 (62): 865-874, 1994