A pairing SW implementation for Smart-Cards

Journal of Systems and Software

Volumn 81, Issue 7, 2008, Pages 1240-1247

  Bertoni, Guido M ^b   Breveglieri, Luca ^a   Chen, Liqun ^c   Fragneto, Pasqualina ^b   Harrison, Keith A ^c   Pelosi, Gerardo ^a  

^a POLITECNICO DI MILANO   (Italy)

^b STMICROELECTRONICS   (Italy)

^c HPLabs   (United Kingdom)

Author keywords

Elliptic curves; Software implementation; Tate pairing

Indexed keywords

CRYPTOGRAPHY; FINITE DIFFERENCE METHOD; HAMMING DISTANCE; OPTIMIZATION; SOFTWARE ARCHITECTURE;

ELLIPTIC CURVES; HAMMING WEIGHT; SOFTWARE IMPLEMENTATION; TATE PAIRING;

SMART CARDS;

EID: 43849098719     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2007.09.022     Document Type: Article

References (40)

1. Adi Shamir, 1984. Identity-Based Cryptosystems and Signature Schemes. In: CRYPTO, pp. 47-53.
2. Balasubramanian R., and Koblitz N. The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. Journal of Cryptology 11 2 (1998) 141-145
3. Barreto, Paulo S.L., 2007. The Pairing-based Crypto Lounge. .
4. Barreto P.S.L.M., Kim H.Y., Lynn B., and Scott M. Efficient algorithms for pairing-based cryptosystems. CRYPTO '02: Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology (2002), Springer-Verlag, London, UK 354-368
5. Barreto P.S.L.M., Lynn B., and Scott M. Constructing elliptic curves with prescribed embedding degrees. SCN. In: Cimato S., Galdi C., and Persiano G. (Eds). Lecture Notes in Computer Science vol. 2576 (2002), Springer 257-267
6. Barreto, P., Galbraith, S., hEigeartaigh, C., Scott, M., 2004. Efficient pairing computation on supersingular abelian varieties. Cryptology ePrint Archive, Report 2004/375. .
7. Blake I.F., Seroussi G., and Smart N. Advances in Elliptic Curve Cryptography (2006), Cambridge University Press
8. Boneh D., and Franklin M.K. Identity-based encryption from the weil pairing. CRYPTO '01: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology (2001), Springer-Verlag, London, UK 213-229
9. Boneh D., Lynn B., and Shacham H. Short signatures from the weil pairing. ASIACRYPT '01: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security. Lecture Notes in Computer Science (2001), Springer-Verlag, London, UK 514-532
10. Boneh D., Boyen X., and Shacham H. Short group signatures. Advances in Cryptology-CRYPTO 2004. Lecture Notes in Computer Science vol. 3152 (2004), Springer-Verlag, Berlin 41-55. Available at
11. Chudnovsky D.V., and Chudnovsky G.V. Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Advances in Applied Mathematics 7 4 (1986) 385-434
12. Cocks C. An identity based encryption scheme based on quadratic residues. IMA Int. Conf. In: Honary B. (Ed). Lecture Notes in Computer Science vol. 2260 (2001), Springer 360-363
13. Cohen H., Miyaji A., and Ono T. Efficient elliptic curve exponentiation using mixed coordinates. ASIACRYPT '98: Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security (1998), Springer-Verlag, London, UK 51-65
14. Dutta, R., Barua, R., Sarkar, P., 2004. Pairing-based cryptographic protocols: a survey. Cryptology ePrint Archive, Report 2005/64. .
15. p - x + d. ASIACRYPT. In: Laih C.-S. (Ed). Lecture Notes in Computer Science vol. 2894 (2003), Springer 111-123
16. Frey G., Müller M., and Rück H.-G. The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Transactions on Information Theory 45 5 (1999) 1717-1719
17. Galbraith S.D., Harrison K., and Soldera D. Implementing the tate pairing. ANTS-V: Proceedings of the 5th International Symposium on Algorithmic Number Theory (2002), Springer-Verlag, London, UK 324-337
18. Galbraith, S., McKee, J., Valenca, P., 2004. Ordinary abelian varieties having small embedding degree. Cryptology ePrint Archive, Report 2004/365. .
19. Gemplus, 2005. ID based cryptography and Smartcards. .
20. Gura N., Patel A., Wander A., Eberle H., and Shantz S.C. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. CHES. In: Joye M., and Quisquater J.-J. (Eds). Lecture Notes in Computer Science vol. 3156 (2004), Springer 119-132
21. Hess F., Smart N.P., and Vercauteren F. The eta pairing revisited. IEEE Transactions on Information Theory 52 10 (2006) 4595-4602
22. International Association for Cryptologic Research, 2007. Cryptology ePrint Archive. .
23. Joux A. A one round protocol for tripartite Diffie-Hellman. ANTS-IV: Proceedings of the 4th International Symposium on Algorithmic Number Theory (2000), Springer-Verlag, London, UK 385-394
24. Karatsuba, A., Ofman, Yu, 1962. Multiplication of many-digital numbers by automatic computers. Doklady Akademii Nauk SSSR, 145, 293-294. Translation in Physics-Doklady, 7, 595-596, 1963.
25. Koblitz N., and Menezes A. Pairing-based cryptography at high security levels. IMA Int. Conf. In: Smart N.P. (Ed). Lecture Notes in Computer Science vol. 3796 (2005), Springer 13-36
26. Menezes A., Okamoto T., and Vanstone S.A. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory 39 5 (1993) 1639-1646
27. Menezes A.J., Vanstone S.A., and Van Oorschot P.C. Handbook of Applied Cryptography (1996), CRC Press Inc., Boca Raton, FL
28. Mont M.C., Bramhall P., and Harrison K. A flexible role-based secure messaging service: exploiting ibe technology for privacy in health care. DEXA '03: Proceedings of the 14th International Workshop on Database and Expert Systems Applications (2003), IEEE Computer Society, Washington, DC, USA 432
29. Montgomery P.L. Modular multiplication without trial division. Mathematics of Computation 44 (1985) 519-521
30. Sakai, R., Ohgishi, K., Kasahara. M., 2000. Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security (SCIS2000).
31. Scott M. Computing the tate pairing. CT-RSA. In: Menezes A. (Ed). Lecture Notes in Computer Science vol. 3376 (2005), Springer 293-304
32. Scott M., and Barreto P.S.L.M. Generating more MNT elliptic curves. Designs Codes and Cryptography 38 2 (2006) 209-217
33. Scott M., Costigan N., and Abdulwahab W. Implementing cryptographic pairings on smartcards. CHES. In: Goubin L., and Matsui M. (Eds). Lecture Notes in Computer Science vol. 4249 (2006), Springer 134-147
34. Silverman J.H. The arithmetic of elliptic curves. Graduate Texts in Mathematics. xii ed. vol. 106 (1994), Springer-Verlang
35. Solinas, Jerome A., 1999. Generalized Mersenne Numbers. Techical Report CORR 99-39, Centre for Applied Cryptographic Research, University of Waterloo.
36. STMicroelectronics, 2005. Data Brief ST22 Smart J Platform Smartcard ICs, February. .
37. STMicroelectronics, 2005. Encryption and smart card technology leaders develop identifier-based encryption for portable formats, April. .
38. Verheul E. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. Advances in Cryptology - Eurocrypt 2001, LNCS 2045 (2001) 195-210
39. Victor, Miller, 1986. Short programs for functions on curve. Unpublished manuscript. Avaliable at .
40. Zhang F., and Kim K. Id-based blind signature and ring signature from pairings. ASIACRYPT '02: Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security (2002), Springer, London, UK 533-547