Implementing cryptographic pairings

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

Volumn 4575 LNCS, Issue , 2007, Pages 177-196

  Scott, Michael ^a  

^a DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

Pairing based cryptosystems; Tate pairmg implementation

Indexed keywords

ELLIPTIC CURVES; EXTENSION FIELDS; INTERNATIONAL CONFERENCES; PAIRING-BASED CRYPTOGRAPHY; PAIRING-BASED CRYPTOSYSTEMS; TATE PAIRING; TATE PAIRMG IMPLEMENTATION;

CRYPTOGRAPHY;

EID: 50049123705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (46)

1. Bailey, D., Paar, C.: Optimal extension field for fast arithmetic in public key algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 472-485. Springer, Heidelberg (1998)
2. 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-368. Springer, Heidelberg (2002)
3. Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 263-273. Springer, Heidelberg (2002)
4. Paulo, S.L.M., Barreto, B., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eels.) SAC 2003. LNCS, vol. 3006, pp. 17-25. Springer, Heidelberg (2003)
5. Barreto, P.S.L.M., 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)
6. Blake, I.F., Seroussi, G., Smart, N.P. (eds.): Advances in Elliptic Curve Cryptography, vol. 2. Cambridge University Press, Cambridge (2005)
7. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM Journal of Computing 32(3), 586-615 (2003)
8. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol 2248, pp. 514-532. Springer,' Heidelberg (2002)
9. Chung, J., Hasan, M.A.: Asymmetric squaring formulae (2006) http://www.cacr.math.uwaterloo.ca/
10. Crandall, R., Pomerance, C.: Prime Numbers: a Computational Perspective. Springer, Heidelberg (2001)
11. Dahab, R., Devegili, A.J., OhEigeartaigh, C., Scott, M.: Multiplication and squaring on pairing-friendly fields. Cryptology ePrint Archive, Report, 2006/471 (2006) http://eprint.iacr.org/2006/471
12. Duan, P., Cui, S., Wah Chan, C.: Special polynomial families for generating more suitable elliptic curves for pairing-based cryptosystems. Cryptology ePrint Archive, Report, 2005/342 (2006) http://eprint.iacr.org/2005/ 342
13. p - x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
14. Eisentrager, K., Lauter, K., Montgomery, P.L.: Fast elliptic curve arithmetic and improved weil pairing evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 343-354. Springer, Heidelberg (2003)
15. Freeman, D., Scott, M., Teske, E.: A. taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report, 2006/372 (2006) http://eprint.iacr.org/2006/372
16. Frey, G., Müller, M., Rück, H.: The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Transactions on Information Theory 45(5), 1717-1719 (1999)
17. Friedland, P.: Absolute value and square root of a complex number. Communications of the ACM 10, 665 (1967)
18. Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory. LNCS, vol. 2369, pp. 324-337. Springer, Heidelberg (2002)
19. Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190-200. Springer, Heidelberg (2001)
20. Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory. LNCS, vol. 4076, pp. 480-494. Springer, Heidelberg (2006)
21. Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive, Report, 2006/172 (2006) http://eprint.iacr.org/2006/172
22. Hei, L., Dong, J., Pei, D.: Implementation of cryptosystems based on Tate pairing. J. Comput. Sc & Technolgy 20(2), 264-269 (2005)
23. ÓhÉigeartaigh, C.: Speeding up pairing computation (2005) http://eprint.iacr.org/2005/293
24. Hess, F., Smart, N., Vercauteren, F.: The Eta pairing revisited. Cryptology ePrint Archive, Report, 2006/110, (2006) http://eprint.iacr.org/2006/ 110
25. Kachisa, E.: Constructing brezing-weng pairing friendly elliptic curves using elements in the cyclotomic field. M.Sc. dissertation, Mzuzu University (2007)
26. Kobayashi, T., Aoki, K., Imai, H.: Efficient algorithms for Tate pairing. IEICE Trans. Fundamentals, E89-A (2006)
27. Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding. LNCS, vol. 3796, pp. 13-36. Springer, Heidelberg (2005)
28. Lenstra, A., Verheul, E.: An overview of the XTR public key system. In: Warsaw Conference on Public-Key cryptography and computational number theory (2001)
29. Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes. Journal of Cryptology 14(4), 255 293 (2001)
30. n). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 405-421. Springer, Heidelberg (2000)
31. Lynn, B.: PBC library (2007) http://crypto.stanford.edu/pbc/download.html
32. Menezes, A.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Dordrecht (1993)
33. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton, Florida (1996) URL: http://caer.math. uwaterloo.ca/hac
34. Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals E84-A(5), 1234-1243 (2001)
35. Montgomery, P.: Modular multiplication without division. Mathematics of Computation 44(170), 519-521 (1985)
36. Schirokauer, O.: The number field sieve for integers of low weight. Cryptography ePrint Archive, Report, 2006/107 (2006) http://eprint.iacr.org/ 2006/107
37. Scott, M.: Faster identity based encryption. Electronics Letters 40(14), 861 (2004)
38. Scott, M.: Computing the Tate pairing. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 293 304. Springer, Heidelberg (2005)
39. Scott, M.: Faster pairings using an elliptic curves with an efficient endomorphism. In: Maitra, S., Madhavan, CE.V., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 258-269. Springer, Heidelberg (2005)
40. Scott, M.: A note on Boneh and Franklin IBE (2005) ftp://ftp.computing. dcu.ie/pub/resources/crypto/note.pdf
41. Scott, M.: Scaling security in pairing-based protocols. Cryptology ePrint Archive, Report, 2005/139 (2005) http://eprint.iacr.org/139
42. Scott, M.: (2007) http://ftp.computing.dcu.ie/pub/crypto/miracl.zip
43. Scott, M., Barreto, P.: Compressed pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 140-156. Springer, Heidelberg (2004), Also available from http ://eprint.iacr.org/2004/032/
44. 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)
45. Solinas, J.: ID-based digital signature algorithms (2003) http://www.caer.math.uwaterloo.ca/conferences/2003/ecc2003/solinas.pdf
46. 2d). IEICE Trans. Fundamentals E88-A(10), 2792-2799 (2005)