Implementing cryptographic pairings on smartcards

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4249 LNCS, Issue , 2006, Pages 134-147

  Scott, Michael ^a   Costigan, Neil ^a   Abdulwahab, Wesam ^a  

^a DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

Elliptic curves; Fast implementations; Pairing based cryptosystems

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SCIENCE; CRYPTOGRAPHY;

ELLIPTIC CURVES; FAST IMPLEMENTATIONS; IDENTITY-BASED ENCRYPTION (IBE); PAIRING-BASED CRYPTOSYSTEMS;

SMART CARDS;

EID: 33750710411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11894063_11     Document Type: Conference Paper

References (38)

1. http://www.mips.com/content/Products/Architecture/SmartMIPSASE/ ProductCatalog/P_SmartMIPSASE/productBrief.
2. P. S. L. M. Barreto. The pairing-based crypto lounge, http://paginas.terra.com.br/informatica/paulobarreto/pblounge.html.
3. P. S. L. M. Barreto, S. Galbraith, C. O'hEigeartaigh, and M. Scott. Efficient pairing computation on supersingular abelian varieties. Cryptology ePrint Archive, Report 2004/375, 2004. http://eprint.iacr.org/2004/375.
4. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - Crypto'2002, volume 2442 of Lecture Notes in Computer Science, pages 354-368. Springer-Verlag, 2002.
5. P. S. L. M. Barreto, B. Lynn, and M. Scott. Constructing elliptic curves with prescribed embedding degrees. In Security in Communication Networks - SCN'2002, volume 2576 of Lecture Notes in Computer Science, pages 263-273. Springer-Verlag, 2002.
6. Paulo S. L. M. Barreto, B. Lynn, and M. Scott. On the selection of pairing-friendly groups. In Selected Areas in Cryptography - SAC'2003, volume 3006 of Lecture Notes in Computer Science, pages 17-25, Ottawa, Canada, 2003. Springer-Verlag.
7. P.S.L.M. Barreto and M. Naehrig. Pairing-friendly elliptic curves of prime order. Cryptology ePrint Archive, Report 2005/133, 2005. http://eprint.iacr.org/ 2005/133.
8. G. M. Bertoni, L. Chen, P. Fragneto, K. A. Harrison, and G. Pelosi. Computing tate pairing on smartcards, 2005. http://www.st.com/stonline/products/ families/smartcard/ches2005_v4.pdf.
9. I. F. Blake, G. Seroussi, and N. P. Smart, editors. Advances in Elliptic Curve Cryptography, Volume 2. Cambridge University Press, 2005.
10. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003.
11. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology - Asiacrypt'2001, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, 2002.
12. L. Chen and Zhaohui Cheng. Security proof of Sakai-Kasahara's identity-based encryption scheme, 2005. http://eprint.iacr.org/2005/226.
13. B. Chevallier-Mames, J-S. Coron, N. McCullagh, D. Naccache, and M. Scott. Secure delegation of elliptic-curve pairing, 2005. http://eprint.iacr.org/2005/ 150.
14. D. Coppersmith. Fast evaluation of logarithms in fields of characteristics two. In IEEE Transactions on Information Theory, volume 30, pages 587-594, 1984.
15. p - x + d. In Advances in Cryptology - Asiacrypt'2003, volume 2894 of Lecture Notes in Computer Science, pages 111-123. Springer-Ver lag, 2003.
16. G. Frey, M. Müller, and H. Rück. The Täte pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Transactions on Information Theory, 45(5):1717-1719, 1999.
17. Gemplus. ID based Cryptography and Smartcards, 2005. http://www.gemplus. com/smart/rd/publications/pdf/Joy05iden.pdf.
18. R. Granger, D. Page, and M. Stam. Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three. Cryptology ePrint Archive, Report 2004/157, 2004. http://eprint.iacr.org/2004/157.
19. m). In CHES, pages 133-147, 2004.
20. J. Hennessy and D. Patterson. Computer Architecture - a Qualitative Approach (third edition). Morgan Kaufmann, 2003.
21. F. Hess, N. Smart, and F. Vercauteren. The eta pairing revisited. Cryptology ePrint Archive, Report 2006/110, 2006. http://eprint.iacr.org/2006/ 110.
22. IEEE Computer Society, New York, USA. IEEE Standard Specifications for Public-Key Cryptography - IEEE Std 1863:2000, 2000.
23. A. Joux. A one-round protocol for tripartite Diffie-Hellman. In Algorithm Number Theory Symposium - ANTS IV, volume 1838 of Lecture Notes in Computer Science, pages 385-394. Springer-Verlag, 2000.
24. A. K. Lenstra. Unbelievable security. Matching AES security using public key systems. In Advances in Cryptology - Asiacrypt 2001, volume 2248, pages 67-86. Springer-Verlag, 2001.
25. R. Lercier. Discrete logarithms in GF(p). Posting to NMBRTHRY List, 2001.
26. N. McCullagh and P. S.L. M. Barreto. Efficient and forward-secure identity-based signcryption. Cryptology ePrint Archive, Report 2004/117, 2004. http://-eprint.iacr.org/2004/117
27. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
28. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of applied cryptography. CRC Press, Boca Raton, Florida, 1996. URL: http://cacr.math.uwaterloo.ca/hac.
29. V. Miller. Short programs for functions on curves, unpublished manuscript, 1986. http://crypto.stanford.edu/miller/miller.pdf.
30. p8, 1998. http://www.trans.cne.okayama-u.-ac.jp/nogami-group/papers/kiyou(2).pdf.
31. D. Page, N. P. Smart, and F. Vercauteren. A comparison of MNT curves and supersingular curves. Cryptology ePrint Archive, 2004. http://eprint.iacr.org/ 2004/165.
32. R. Sakai and M. Kasahara. ID based cryptosystems with pairing on elliptic curve. Cryptography ePrint Archive, Report 2003/054, 2003. http://eprint.iacr. org/2003/054.
33. R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. The 2000 Symposium on Cryptography and Information Security, Okinawa, Japan, 2000.
34. M. Scott. Computing the Tate pairing. In CT-RSA, volume 3376 of Lecture Notes in Computer Science, pages 293-304. Springer-Verlag, 2005.
35. M. Scott, 2006. http://ftp.computing.dcu.ie/pub/crypto/mirac1.zip.
36. M. Scott and P. Barreto. Compressed pairings. In Advances in Cryptology -Crypto' 2004, volume 3152 of Lecture Notes in Computer Science, pages 140-156. Springer-Verlag, 2004. Also available from http://eprint.iacr.org/2004/032/.
37. A. Shamir. Identity-based cryptosystems and signature schemes. In Proceedings of Crypto 1984, volume 196 of Lecture Notes in Computer Science, pages 47-53. Springer-Verlag, 1984.
38. 2607. In Advances in Cryptology - Asiacrypt'2001, volume 2248 of Lecture Notes in Computer Science, pages 107-124. Springer-Verlag, 2001.