Skip to main content
SpringerLink
Log in
Book cover

International Conference on Pairing-Based Cryptography

Pairing 2013: Pairing-Based Cryptography – Pairing 2013 pp 131–148Cite as

Fast Symmetric Pairing Revisited

  • Conference paper

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

Abstract

During the past decade pairing-based cryptosystems have been through a huge development, and the implementation of bilinear pairings has been improved greatly. Two pairing models, namely symmetric and asymmetric pairings, are widely used and have common cryptographic properties in most cryptosystems. Symmetric pairings are more convenient to construct cryptographic schemes, but asymmetric pairings are more efficient and suitable for implementation due to their flexible embedding degrees. In this paper we revisit symmetric pairings on supersingular elliptic curves over large characteristic fields. We show that a special family of supersingular elliptic curves with embedding degree 3 admits a kind of fast symmetric pairings, whose computational costs might be twice the costs for the current fastest asymmetric pairings.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adj, G., Menezes, A., Oliveira, T., Rodríguez-Henríquez, F.: Weakness of \(\mathbb{F}_{3^{6*509}}\) for discrete logarithm cryptography. IACR ePrint Archive Report 2013/446

    Google Scholar 

  2. Ahmadi, O., Hankerson, D., Menezes, A.: Software implementation of arithmetic in \(\mathbb{F}_{3^m}\). In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 85–102. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Aranha, D.F., Fuentes-Castañeda, L., Knapp, E., Menezes, A., Rodríguez-Henríquez, F.: Implementing Pairings at the 192-Bit Security Level. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 177–195. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Aranha, D., Karabina, K., Longa, P., Gebotys, C., López, J.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 48–68. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Aranha, D.F., López, J., Hankerson, D.: High-Speed Parallel Software Implementation of the η T Pairing. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 89–105. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Barbulescu, R., Gaudry, P., Joux, A., Thomé, E.: A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. IACR ePrint Archive Report 2013/400

    Google Scholar 

  7. Barreto, P., Galbraith, S., 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 

  8. 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–369. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Barreto, P., 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. Benger, N., Scott, M.: Constructing tower extensions of finite fields for implementation of pairing-based cryptography. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 180–195. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Rodríguez-Henríquez, F.: A Comparison between Hardware Accelerators for the Modified Tate Pairing over \(F_{2^m}\) and \(F_{3^m}\). In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 297–315. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Beuchat, J.L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and Arithmetic Operators for Computing the η T Pairing in Characteristic Three. IEEE Transactions on Computers 57(11), 1454–1468 (2008)

    Article  MathSciNet  Google Scholar 

  13. Beuchat, J.L., Detrey, J., Estibals, N., Okamoto, E., Rodríguez-Henríquez, F.: Fast Architectures for the η T Pairing over Small-Characteristic Supersingular Elliptic Curves. IEEE Transactions on Computers 60(2), 266–281 (2011)

    Article  Google Scholar 

  14. Beuchat, J.-L., López-Trejo, E., Martínez-Ramos, L., Mitsunari, S., Rodríguez-Henríquez, F.: Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 413–432. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Blake, I., Seroussi, G., Smart, N.: Advances in Elliptic Curve Cryptography. LMS Lecture Note Series, vol. 317. Cambridge University Press (2005)

    Google Scholar 

  16. Costello, C., Hisil, H., Boyd, C., Gonzalez Nieto, J., Wong, K.K.-H.: Faster Pairings on Special Weierstrass Curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 89–101. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 224–242. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Fuentes-Castañeda, L., Knapp, E., Rodríguez-Henríquez, F.: Faster Hashing to \({\mathbb G}_2\). In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 412–430. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Ghosh, S., Roychowdhury, D., Das, A.: High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 442–458. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  20. Ghosh, S., Verbauwhede, I., Roychowdhury, D.: Core Based Architecture to Speed Up Optimal Ate Pairing on FPGA Platform. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 141–159. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  21. Granger, R., Scott, M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 209–223. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  22. Granger, R., Smart, N.: On computing products of pairings. IACR ePrint Archive Report 2006/172

    Google Scholar 

  23. Großschädl, J.: TinySA: A security architecture for wireless sensor networks. In: CoNEXT 2006, pp. 288–289. ACM Press (2006)

    Google Scholar 

  24. Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 18–38. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Hitt, L.: On the minimal embedding field. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 294–301. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Joux, A.: A new index calculus algorithm with complexity L(1/4 + o(1)) in very small characteristic. IACR ePrint Archive Report 2013/095

    Google Scholar 

  27. Karabina, K.: Squaring in cyclotomic subgroups. Mathematics of Computation 82(281), 555–579 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  28. Le, D.-P., Tan, C.H.: Speeding up ate pairing computation in affine coordinates. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 262–277. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  29. Menezes, A., Okamoto, T., Vanstone, S.: Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Transactions on Information Theory 39(5), 1639–1646 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  30. Miller, V.: Short programs for functions on curves (1986) (unpublished manuscript)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  32. Pereira, G., Simplício, M., Naehrig, M., Barreto, P.: A family of implementation-friendly BN elliptic curves. Journal of Systems and Software 84, 1319–1326 (2011)

    Article  Google Scholar 

  33. Scott, M., Barreto, P.: Generating More MNT Elliptic Curves. Designs, Codes and Cryptography 38, 209–217 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  34. 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., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 78–88. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  35. Silverman, J.: The Arithmetic of Elliptic Curves. GTM, vol. 106. Springer (2009)

    Google Scholar 

  36. Vercauteren, F.: Optimal Pairings. IEEE Transactions on Information Theory 56(1), 455–461 (2010)

    Article  MathSciNet  Google Scholar 

  37. Yao, G.X., Fan, J., Cheung, R.C.C., Verbauwhede, I.: Faster Pairing Coprocessor Architecture. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 160–176. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  38. Zhang, X., Lin, D.: Analysis of Optimum Pairing Products at High Security Levels. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 412–430. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  39. Zhang, X., Wang, K., Lin, D.: On Efficient Pairings on Elliptic Curves over Extension Fields. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 1–18. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  40. Zhang, Y., Großschädl, J.: Efficient Prime-Field Arithmetic for Elliptic Curve Cryptography on Wireless Sensor Nodes. In: ICCSNT 2011, pp. 459–466. IEEE (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Software, Chinese Academy of Sciences, Beijing, China

    Xusheng Zhang

  2. Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China

    Kunpeng Wang

Authors
  1. Xusheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kunpeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, No. 800, Dongchuan Road, 200240, Shanghai, China

    Zhenfu Cao

  2. School of Information Science and Technology, Sun Yat-sen University, No. 135, Xingang Xi Road, 510275, Guangzhou, China

    Fangguo Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, X., Wang, K. (2014). Fast Symmetric Pairing Revisited. In: Cao, Z., Zhang, F. (eds) Pairing-Based Cryptography – Pairing 2013. Pairing 2013. Lecture Notes in Computer Science, vol 8365. Springer, Cham. https://doi.org/10.1007/978-3-319-04873-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04873-4_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04872-7

  • Online ISBN: 978-3-319-04873-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation