Eta pairing computation on general divisors over hyperelliptic curves y2 = x7 - X ± 1

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

Volumn 4575 LNCS, Issue , 2007, Pages 349-366

  Lee, Eunjeong ^a   Lee, Hyang Sook ^b   Lee, Yoonjin ^c  

^a Korea Institute for Advanced Study   (South Korea)

^b Ewha Womans University   (South Korea)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Divisors; Eta pairing; Hyperelliptic curves; Pairing based cryptosystem; Resultant; Tate pairing

Indexed keywords

CRYPTOGRAPHY; ELECTRIC NETWORK ANALYSIS;

DIVISORS; EFFICIENT METHODS; ETA PAIRING; EXPLICIT ALGORITHMS; HYPERELLIPTIC CURVES; INTERNATIONAL CONFERENCES; PAIRING-BASED CRYPTOGRAPHY; PAIRING-BASED CRYPTOSYSTEM; RESULTANT; TATE PAIRING; THEORETICAL ANALYSIS;

CODES (SYMBOLS);

EID: 50049130844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73489-5_20     Document Type: Conference Paper

References (29)

1. Araki, K., Miura, S., Satoh, T.: Overview of elliptic curve crptography. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 29-49. Springer, Heidelberg (1998)
2. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354-368. Springer, Heidelberg (2002)
3. Barreto, P.S.L.M., Galbraith, S., ÓhÉigeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Des. Codes Cryptogr. 42, 239-271 (2007)
4. Berlekamp, E.R: Factoring polynomials over large finite fields. Math. Comp. 24, 713-735 (1970)
5. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
6. Cha, J.C., Cheon, J.H.: An Identity-Based Signature from Gap Diffie-Hellman Groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18-30. Springer, Heidelberg (2002)
7. Choie, Y., Lee, E.: Implementation of Tate pairing on hyperelliptic curves of genus 2. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 97-111. Springer, Heidelberg (2004)
8. Cox, D., Little, J., O'Shea, D.: Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra: with 91 illustrations. Springer, New York (1997)
9. Duursma, I.: Class numbers for hyperelliptic curves. In: Pellikaan, Perret, Vladuts (eds.) Arithmetic, Geometry and Coding Theory, pp. 45-52. deGruyter, Berlin (1996)
10. p - x + 1 over a finite field of odd characteristic p. In: Coding theory, cryptography and related areas (Guanajuato, 1998) pp. 73-89. Springer, Heidelberg (2000)
11. p- x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
12. Frey, G., Rück, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 62(206), 865-874 (1994)
13. Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory - V. LNCS, vol. 2369, pp. 324-337. Springer, Heidelberg (2002)
14. Greuel, G.-M., Pfister, G., Schönemann, H.: SINGULAR 3.0. A Computer Algebra System for PolynomialComputations. Centre for Computer Algebra, University of Kaiserslautern (2005) http://www.singular.uni-kl.de
15. Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) Algorithmic Number Theory IV. LNCS, vol. 1838, pp. 385-394. Springer, Heidelberg (2000)
16. Hess, F., Smart, N.P., Vercauteren, F.: The Eta Pairing Revisited. IEEE Trans. Information Theory 52, 4595-4602 (2006)
17. Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata (Engl. transl.) Sov. Phys.-Dokl. 7(7), 595-596 (1963)
18. Knuth, D.E.: The Art of Computer Programming, vol. II.Addison Wesley, London (2004)
19. Koblitz, N.: Algebraic Aspects of Cryptography. Springer, Heidelberg (1998)
20. Koblitz, N., Menezes, A. Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding. LNCS, vol. 3796, pp. 3-36. Springer, Heidelberg (2005)
21. Kwon, S.: Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. In: Boyd, C. González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 134-145. Springer, Heidelberg (2005)
22. Lange, T.: Formulae for arithmetic on genus 2 hyperelliptic curves. Appl. Algebra Engrg. Comm. Comput. 15(5), 295-328 (2005)
23. Mumford, D.: Tata Lectures on Theta II, Birkhauser (1984)
24. Paterson, K.G.: ID-based signature from pairings on elliptic curves. Electronics Letters 38(18), 1025-1026 (2002)
25. Pelzl, J., Wollinger, T., Paar, C.: Low cost security: explicit formulae for genus-4 hyperelliptic curves. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 1-16. Springer, Heidelberg (2004)
26. Shoup, V.: A library for doing number theory, Software (2001) http://www.shoup.net/ntl/
27. Smart, N.: On the Performance of Hyperelliptic Cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 165-175. Springer, Heidelberg (1999)
28. Smart, N.P.: An identity based authentication key agreement protocol based on pairing. Electronics Letters 38, 630-632 (2002)
29. Yap, C.K.: Fundamental Problems in Algorithmic Algebra. Oxford University Press, Oxford (2000)