Skip to main content
Springer Nature Link
Log in

Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures

  • Conference paper
  • First Online:
Mathematical Aspects of Computer and Information Sciences (MACIS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9582))

  • 763 Accesses

Abstract

In this paper, we show how bilinear pairings can be implemented on modern smart card architectures. We do this by providing a memory-efficient implementation of the eta pairing on accumulator based cryptographic coprocessors. We provide timing results for different key-sizes on a state of the art smart card, the Infineon SLE 78. On one hand, our results show that pairings can efficiently be computed on smart cards. On the other hand, our results identify bottlenecks that have to be considered for future smart card designs.

This work was partially supported by the German Ministry of Education and Research, grant 16KIS0062.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Barbulescu, R., Gaudry, P., Joux, A., Thomé, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 1–16. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  2. Barreto, P.S.L.M., Galbraith, S.D., O’Eigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Crypt. 42(3), 239–271 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bertoni, G., Breveglieri, L., Chen, L., Fragneto, P., Harrison, K.A., Pelosi, G.: A pairing SW implementation for Smart-Cards. J. Syst. Softw. 81(7), 1240–1247 (2008)

    Article  Google Scholar 

  4. 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 F2m and F3m. IACR Cryptology ePrint Archive 2008, 115 (2008). http://eprint.iacr.org/

  5. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discrete Appl. Math. 156(16), 3113–3121 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Infineon Technologies AG: Product Brief SLE 78 (PB_SLE78CXxxxP.pdf), January 2014

    Google Scholar 

  9. Joye, M., Neven, G. (eds.): Identity-Based Cryptography, Cryptology and Information Security, vol. 2. IOS Press, Amsterdam (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Oliveira, L.B., Aranha, D.F., Gouvêa, C.P.L., Scott, M., Câmara, D.F., López, J., Dahab, R.: TinyPBC: pairings for authenticated identity-based non-interactive key distribution in sensor networks. Comput. Commun. 34(3), 485–493 (2011)

    Article  Google Scholar 

  12. Scott, M., Costigan, N., Abdulwahab, W.: Implementing cryptographic pairings on smartcards. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 134–147. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Paderborn, Paderborn, Germany

    Peter Günther

  2. Wincor Nixdorf International GmbH, Paderborn, Germany

    Volker Krummel

Authors
  1. Peter Günther
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Volker Krummel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Günther .

Editor information

Editors and Affiliations

  1. Wilfrid Laurier University, Waterloo, Ontario, Canada

    Ilias S. Kotsireas

  2. Hamburg University of Technology, Hamburg, Germany

    Siegfried M. Rump

  3. New York University, New York, New York, USA

    Chee K. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Günther, P., Krummel, V. (2016). Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures. In: Kotsireas, I., Rump, S., Yap, C. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2015. Lecture Notes in Computer Science(), vol 9582. Springer, Cham. https://doi.org/10.1007/978-3-319-32859-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32859-1_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32858-4

  • Online ISBN: 978-3-319-32859-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics