Skip to main content

Generators for the ℓ-Torsion Subgroup of Jacobians of Genus Two Curves

  • Conference paper
Pairing-Based Cryptography – Pairing 2008 (Pairing 2008)

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

Included in the following conference series:

  • 896 Accesses

Abstract

We give an explicit description of the matrix representation of the Frobenius endomorphism on the Jacobian of a genus two curve on the subgroup of ℓ-torsion points. By using this description, we can describe the matrix representation of the Weil-pairing on the subgroup of ℓ-torsion points explicitly. Finally, the explicit description of the Weil-pairing provides us with an efficient, probabilistic algorithm to find generators of the subgroup of ℓ-torsion points on the Jacobian of a genus two curve.

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. Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Computing 32(3), 586–615 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cassels, J.W.S., Flynn, E.V.: Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1996)

    MATH  Google Scholar 

  3. Duursma, I., Lee, H.-S.: Tate pairing implementation for hyperelliptic curves y 2 = x p − x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111–123. Springer, Heidelberg (2003)

    Google Scholar 

  4. Eisenträger, K., Lauter, K.: A CRT algorithm for constructing genus 2 curves over finite fields, arXiv:math/0405305, to appear in Proceedings of AGCT-10 (preprint, 2007)

    Google Scholar 

  5. Freeman, D., Lauter, K.: Computing endomorphism rings of jacobians of genus 2 curves over finite fields. In: Hirschfeld, J., Chaumine, J., Rolland, R. (eds.) Algebraic geometry and its applications, Proceedings of the First SAGA conference, Papeete, May 7–11, 2007. Number Theory and Its Applications, vol. 5, pp. 29–66. World Scientific, Singapore (2008)

    Google Scholar 

  6. Frey, G., Lange, T.: Varieties over special fields. In: Cohen, H., Frey, G. (eds.) Handbook of Elliptic and Hyperelliptic Curve Cryptography, pp. 87–113. Chapman & Hall/CRC (2006)

    Google Scholar 

  7. 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, 865–874 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Galbraith, S.D.: Pairings. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol. 317, pp. 183–213. Cambridge University Press, Cambridge (2005)

    Google Scholar 

  9. Galbraith, S.D., Hess, F., Vercauteren, F.: Hyperelliptic pairings. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 108–131. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Gaudry, P., Houtmann, T., Kohel, D., Ritzenthaler, C., Weng, A.: The p-adic CM-method for genus 2 (preprint, 2005) arXiv:math/0503148

    Google Scholar 

  11. Hess, F.: A note on the tate pairing of curves over finite fields. Arch. Math. 82, 28–32 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Howe, E.W., Nart, E., Ritzenthaler, C.: Jacobians in isogeny classes of abelian surfaces over finite fields (preprint, 2007) arXiv:math/0607515

    Google Scholar 

  13. Koblitz, N.: Elliptic curve cryptosystems. Math. Comp. 48, 203–209 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptology 1, 139–150 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lang, S.: Abelian Varieties. Interscience (1959)

    Google Scholar 

  16. Maisner, D., Nart, E., Howe, E.W.: Abelian surfaces over finite fields as jacobians. Experimental Mathematics 11(3), 321–337 (2002)

    MATH  MathSciNet  Google Scholar 

  17. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  18. Miller, V.S.: The weil pairing, and its efficient calculation. J. Cryptology 17, 235–261 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Milne, J.S.: Abelian varieties (1998), http://www.jmilne.org

  20. Neukirch, J.: Algebraic Number Theory. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  21. Ravnshøj, C.R.: Generators of Jacobians of hyperelliptic curves, (preprint, 2007) arXiv:0704.3339

    Google Scholar 

  22. Ravnshøj, C.R.: Non-cyclic subgroups of Jacobians of genus two curves (preprint, 2008) arXiv:0801.2835

    Google Scholar 

  23. Weng, A.: Constructing hyperelliptic curves of genus 2 suitable for cryptography. Math. Comp. 72, 435–458 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Steven D. Galbraith Kenneth G. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ravnshøj, C.R. (2008). Generators for the ℓ-Torsion Subgroup of Jacobians of Genus Two Curves. In: Galbraith, S.D., Paterson, K.G. (eds) Pairing-Based Cryptography – Pairing 2008. Pairing 2008. Lecture Notes in Computer Science, vol 5209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85538-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85538-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85503-3

  • Online ISBN: 978-3-540-85538-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics