Skip to main content
SpringerLink
Log in

New Software Speed Records for Cryptographic Pairings

  • Conference paper
Progress in Cryptology – LATINCRYPT 2010 (LATINCRYPT 2010)

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

Abstract

This paper presents new software speed records for the computation of cryptographic pairings. More specifically, we present details of an implementation which computes the optimal ate pairing on a 257-bit Barreto-Naehrig curve in only 4,470,408 cycles on one core of an Intel Core 2 Quad Q6600 processor.

This speed is achieved by combining 1.) state-of-the-art high-level optimization techniques, 2.) a new representation of elements in the underlying finite fields which makes use of the special modulus arising from the Barreto-Naehrig curve construction, and 3.) implementing arithmetic in this representation using the double-precision floating-point SIMD instructions of the AMD64 architecture.

This work has been supported in part by the European Commission through the ICT Programme under Contract ICT–2007–216499 CACE, and through the ICT Programme under Contract ICT-2007-216646 ECRYPT II. Permanent ID of this document: 4d8d6cd8dc32f9524bb84bbe9c148076. Date: May 28, 2010.

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

Access this chapter

Log in via an institution
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. The GNU MP bignum library, http://gmplib.org/ (accessed March 31, 2010)

  2. MPFQ - a finite field library, http://mpfq.gforge.inria.fr/ (accessed March 31, 2010)

  3. Arène, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster pairing computation. Cryptology ePrint Archive, Report 2009/155, to appear in the Journal of Number Theory (2010), http://eprint.iacr.org/2009/155/

  4. Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for key management - part 1: General (revised). Published as NIST Special Publication 800-57 (2007), http://csrc.nist.gov/groups/ST/toolkit/documents/SP800-57Part1_3-8-07.pdf

  5. Barreto, P.S.L.M.: A survey on craptological pairing algorithms. Journal of Craptology 7 (2010), http://www.anagram.com/~jcrap/Volume_7/Pairings.pdf

  6. Barreto, P.S.L.M., Galbraith, S.D., Ó’ hÉigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42(3), 239–271 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. Journal of Cryptology 17(4), 321–334 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319–331. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Bernstein, D.J.: qhasm: tools to help write high-speed software, http://cr.yp.to/qhasm.html (accessed March 31, 2010)

  11. Bernstein, D.J.: Floating-point arithmetic and message authentication, Document ID: dabadd3095644704c5cbe9690ea3738e (2004), http://cr.yp.to/papers.html#hash127

  12. Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207–228. Springer, Heidelberg (2006) Document ID: 4230efdfa673480fc079449d90f322c0, http://cr.yp.to/papers.html#curve25519

    Chapter  Google Scholar 

  13. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)

    Google Scholar 

  14. Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over Barreto-Naehrig curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 197–207. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Smart, N. (ed): ECRYPT2 yearly report on algorithms and keysizes (2008-2009). Technical report, ECRYPT II – European Network of Excellence in Cryptology, EU FP7, ICT-2007-216676 (2009) (published as deliverable D.SPA.7), http://www.ecrypt.eu.org/documents/D.SPA.7.pdf

  16. Fan, J., Vercauteren, F., Verbauwhede, I.: Faster \(\mathbb{F}_p\)-arithmetic for cryptographic pairings on Barreto-Naehrig curves. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 240–253. Springer, Heidelberg (2009), http://www.cosic.esat.kuleuven.be/publications/article-1256.pdf

    Chapter  Google Scholar 

  17. Fog, A.: Software optimization ressources (2010), http://www.agner.org/optimize/ (accessed March 31, 2010)

  18. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Journal of Cryptology 23(2), 224–280 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  19. Grabher, P., Großschädl, J., Page, D.: On software parallel implementation of cryptographic pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 34–49. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Granger, R., Scott, M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen, P., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 209–223. Springer, Heidelberg (2010), http://eprint.iacr.org/2009/565/

  21. Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415–432. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. In: Joye, M., Neven, G. (eds.) Identity-Based Cryptography. IOS Press, Amsterdam (2008), http://www.math.uwaterloo.ca/~ajmeneze/publications/pairings_software.pdf

    Google Scholar 

  23. Heß, F., Smart, N.P., Vercauteren, F.: The eta pairing revisited. IEEE Transactions on Information Theory 52, 4595–4602 (2006)

    Article  MATH  Google Scholar 

  24. Lee, E., Lee, H.-S., Park, C.-M.: Efficient and generalized pairing computation on abelian varieties. Cryptology ePrint Archive, Report 2008/040 (2008), http://eprint.iacr.org/2008/040/

  25. Shamus Software Ltd. Multiprecision integer and rational arithmetic C/C++ library, http://www.shamus.ie/ (accessed March 31, 2010)

  26. Miller, V.S.: Short programs for functions on curves (Unpublished manuscript) (1986), http://crypto.stanford.edu/miller/miller.pdf

  27. Miller, V.S.: The Weil pairing, and its efficient calculation. Journal of Cryptology 17, 235–261 (2004)

    Article  MATH  Google Scholar 

  28. Naehrig, M.: Constructive and Computational Aspects of Cryptographic Pairings. PhD thesis, Technische Universiteit Eindhoven (2009), http://www.cryptojedi.org/users/michael/data/thesis/2009-05-13-diss.pdf

  29. Naehrig, M., Barreto, P.S.L.M., Schwabe, P.: On compressible pairings and their computation. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 371–388. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  30. Scott, M.: Personal communication (March 2010)

    Google Scholar 

  31. Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H. (ed.) Pairing 2009. LNCS, vol. 5671, pp. 78–88. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  32. Vercauteren, F.: Optimal pairings. IEEE Transactions on Information Theory 56(1) (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA

    Michael Naehrig

  2. Department of Electrical Engineering, National Taiwan University, 1 Section 4 Roosevelt Road, Taipei, 106-70, Taiwan

    Ruben Niederhagen

  3. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600, MB, Eindhoven, Netherlands

    Ruben Niederhagen & Peter Schwabe

Authors
  1. Michael Naehrig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruben Niederhagen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Schwabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, École Normale Supérieure, 45 Rue d’Ulm, 75230, Paris Cedex 05, France

    Michel Abdalla

  2. Computer Architecture and Networking Laboratory (LARC), Universidade de Sáo Paulo, Av. Prof. Luciano Gualberto, trav.3, n.158, 05508-900, Sáo Paulo (SP), Brazil

    Paulo S. L. M. Barreto

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Naehrig, M., Niederhagen, R., Schwabe, P. (2010). New Software Speed Records for Cryptographic Pairings . In: Abdalla, M., Barreto, P.S.L.M. (eds) Progress in Cryptology – LATINCRYPT 2010. LATINCRYPT 2010. Lecture Notes in Computer Science, vol 6212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14712-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14712-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14711-1

  • Online ISBN: 978-3-642-14712-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation