Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Ciobanu, Laura / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year


CiteScore 2017: 0.32

SCImago Journal Rank (SJR) 2017: 0.208
Source Normalized Impact per Paper (SNIP) 2017: 0.322

Mathematical Citation Quotient (MCQ) 2017: 0.32

Online
ISSN
1869-6104
See all formats and pricing
More options …

Faster Ate pairing computation on Selmer's model of elliptic curves

Emmanuel Fouotsa
  • Laboratoire de Mathématiques Nicolas Oresme(LMNO), Université de Caen, Basse Normandie B.P. 5186, 14032 Caen Cedex, France; and Department of Mathematics, Higher Teacher Training College, University of Bamenda, P.O. Box 39, Bambili, Cameroon
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Abdoul Aziz Ciss
  • Corresponding author
  • Laboratoire de Traitement de l'Information et Systèmes Intelligents, Ecole Polytechnique de Thies, Senegal
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
Published Online: 2016-04-07 | DOI: https://doi.org/10.1515/gcc-2016-0005

Abstract

This paper revisits the computation of pairings on a model of elliptic curve called Selmer curves. We extend the work of Zhang, Wang, Wang and Ye [17] to the computation of other variants of the Tate pairing on this curve. Especially, we show that the Selmer model of an elliptic curve presents faster formulas for the computation of the Ate and optimal Ate pairings with respect to Weierstrass elliptic curves. We show how to parallelise the computation of these pairings and we obtained very fast results. We also present an example of optimal pairing on a pairing-friendly Selmer curve of embedding degree k = 12.

Keywords: Selmer curves; Miller's algorithm; Tate pairing; Ate pairing; optimal pairing

MSC: 14H52

References

  • 1

    D. F. Aranha, L. Fuentes-Castañeda, E. Knapp, A. Menezes and F. Rodríguez-Henríquez, Implementing pairings at the 192-bit security level, Pairing-Based Cryptography – Pairing 2012 (Cologne 2012), Lecture Notes in Comput. Sci. 7708, Springer, Berlin (2013), 177–195. Google Scholar

  • 2

    P. S. L. M. Barreto, S. D. Galbraith, C. O'Eigeartaigh and M. Scott, Efficient pairing computation on supersingular abelian varieties, Des. Codes Cryptogr. 42 (2007), 3, 239–271. Google Scholar

  • 3

    D. Boneh and M. K. Franklin, Identity-based encryption from the weil pairing, Advances in Cryptology – CRYPTO 2001 (Santa Barbara 2001), Lecture Notes in Comput. Sci. 2139, Springer, Berlin (2001), 213–229. Google Scholar

  • 4

    W. Bosma, J. Cannon and C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), 3–4, 235–265. Google Scholar

  • 5

    C. Costello, T. Lange and M. Naehrig, Faster pairing computations on curves with high-degree twists, Public Key Cryptography – PKC 2010 (Paris 2010), Lecture Notes in Comput. Sci. 6056, Springer, Berlin (2010), 224–242. Google Scholar

  • 6

    S. Duquesne and G. Frey, Background on pairings, Handbook of Elliptic and Hyperelliptic Curve Cryptography, CRC Press, Boca Raton (2005), 115–124. Google Scholar

  • 7

    R. Dutta, R. Barua and P. Sarkar, Pairing-based cryptographic protocols: A survey, IACR Cryptol. ePrint Arch. 2004 (2004), Paper No. 64. Google Scholar

  • 8

    R. R. Farashahi and M. Joye, Efficient arithmetic on Hessian curves, Public Key Cryptography – PKC 2010 (Paris 2010), Lecture Notes in Comput. Sci. 6056, Springer, Berlin (2010), 243–260. Google Scholar

  • 9

    D. Freeman, M. Scott and E. Teske, A taxonomy of pairing-friendly elliptic curves, J. Cryptology 23 (2010), 2, 224–280. Web of ScienceGoogle Scholar

  • 10

    G. Frey, M. Müller and H. Rück, The tate pairing and the discrete logarithm applied to elliptic curve cryptosystems, IEEE Trans. Inform. Theory 45 (1999), 5, 1717–1719. Google Scholar

  • 11

    S. Galbraith, Pairings, Advances in Elliptic Curve Cryptography, London Math. Soc. Lecture Note Ser. 317, Cambridge University Press, Cambridge (2005), 183–213. Google Scholar

  • 12

    F. Hess, Pairing lattices, Pairing-Based Cryptography – Pairing 2008 (Egham 2008), Lecture Notes in Comput. Sci. 5209, Springer, Berlin (2008), 18–38. Google Scholar

  • 13

    F. Hess, N. P. Smart and F. Vercauteren, The eta pairing revisited, IEEE Trans. Inform. Theory 52 (2006), 10, 4595–4602. Google Scholar

  • 14

    A. Joux, A one round protocol for tripartite Diffie–Hellman, Algorithmic Number Theory – ANTS-IV (Leiden 2000), Lecture Notes in Comput. Sci. 1838, Springer, Berlin (2008), 385–393. Google Scholar

  • 15

    V. S. Miller, The Weil pairing, and its efficient calculation, J. Cryptology 17 (2004), 4, 235–261. Google Scholar

  • 16

    F. Vercauteren, Optimal pairings, IEEE Trans. Inform. Theory 56 (2010), 1, 455–461. Google Scholar

  • 17

    L. Zhang, K. Wang, H. Wang and D. Ye, Another elliptic curve model for faster pairing computation, Information Security Practice and Experience – ISPEC 2011 (Guangzhou 2011), Lecture Notes in Comput. Sci. 6672, Springer, Berlin (2011), 432–446. Google Scholar

About the article

Received: 2015-07-22

Published Online: 2016-04-07

Published in Print: 2016-05-01


Funding Source: ANR SIMPATIC

Award identifier / Grant number: ANR-12-INSE-0014

Funding Source: Simons Foundation

Award identifier / Grant number: Pole of Research in Mathematics with applications to Information Security, Subsaharan Africa

The first author is a postdoctoral researcher supported by French ANR SIMPATIC project (ANR-12-INSE-0014). The authors acknowledge support from MACISA-LIRIMA project and the Simons Foundation through Pole of Research in Mathematics with applications to Information Security, Subsaharan Africa.


Citation Information: Groups Complexity Cryptology, Volume 8, Issue 1, Pages 55–67, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2016-0005.

Export Citation

© 2016 by De Gruyter.Get Permission

Comments (0)

Please log in or register to comment.
Log in