Skip to main content

Formulae for Computation of Tate Pairing on Hyperelliptic Curve Using Hyperelliptic Nets

  • Conference paper
Progress in Cryptology – AFRICACRYPT 2014 (AFRICACRYPT 2014)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 8469))

Included in the following conference series:

Abstract

Stange has showed how to compute the Tate pairing on an elliptic curve using elliptic nets. After that, Uchida and Uchiyama gave a generalization of elliptic nets to hyperelliptic curves. They also gave an algorithm to compute the Tate pairing on a hyperelliptic curve of genus 2. In this paper, we extend their algorithm for curves of all genus. In a computational point of view, we also study the optimality of these algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of elliptic and hyperelliptic curve cryptography. Discrete Mathematics and Its Applications, vol. 34, pp. 115–123. CRC Press (2006)

    Google Scholar 

  2. Balakrishnan, J., Belding, J., Chisholm, S., Eeisenträger, K., Stange, K.E., Teske, E.: Pairings on hyperelliptic curves. ArXiv e-prints, 09083731 (2009)

    Google Scholar 

  3. Blake, I., Seroussi, G., Smart, N.: Advances in elliptic curve cryptography. London Mathematical Society Lecture Note Series, vol. 317, pp. 183–212. Cambridge University press (2005)

    Google Scholar 

  4. Buchstaber, V., Enolskii, V.: Explicit algebraic description of hyperelliptic jacobians on the basis of the Klein σ-functions. Functional Analysis and Its Applications 30(1), 44–47 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Buchstaber, V., Enolskii, V., Leykin, D.: A recursive family of differential polynomials generated by the Sylvester identity and additions theorems for hyperelliptic Kleinian functions. Functional Analysis and Its Applications 34(4), 240–251 (1997)

    Article  Google Scholar 

  6. Buchstaber, V., Enolskii, V., Leykin, D.: Hyperelliptic Kleinian functions and applications. Solitons Geometry and Topology: On the Crossroad, Advances in Math. Sciences, Am. Math. Soc. Transl, Series 2 179, 1–34 (1997)

    Google Scholar 

  7. Cantor, D.: Computing in the Jacobian of a hyperelliptic curve. Mathematics of Computation 48(177), 95–101 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Eilbeck, J., England, M., Ônishi, Y.: Abelian functions associated with genus three algebraic curves. LMS J. Comput. Math. 14, 291–326 (2011)

    Article  MathSciNet  Google Scholar 

  9. Ogura, N., Kanayama, N., Uchiyama, S., Okamoto, E.: Cryptographic pairings based on elliptic nets. In: Iwata, T., Nishigaki, M. (eds.) IWSEC 2011. LNCS, vol. 7038, pp. 65–78. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Silverman, J.: The arithmetic of elliptic curves, pp. 157–178. Springer, New York (1985)

    Google Scholar 

  11. Stange, K.E.: The Tate pairing via elliptic nets. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 329–348. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Uchida, Y.: Division polynomials and canonical local heights on hyperelliptic Jacobians. Manuscrypta Mathematica 134(3-4), 273–308 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  13. Uchida, Y., Uchiyama, S.: The Tate-Lichtenbaum pairing on a hyperelliptic curve via hyperelliptic nets. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 218–233. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Tran, C. (2014). Formulae for Computation of Tate Pairing on Hyperelliptic Curve Using Hyperelliptic Nets. In: Pointcheval, D., Vergnaud, D. (eds) Progress in Cryptology – AFRICACRYPT 2014. AFRICACRYPT 2014. Lecture Notes in Computer Science, vol 8469. Springer, Cham. https://doi.org/10.1007/978-3-319-06734-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06734-6_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06733-9

  • Online ISBN: 978-3-319-06734-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics