High-speed parallel software implementation of the ηT pairing

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

Volumn 5985 LNCS, Issue , 2010, Pages 89-105

  Aranha, Diego F ^a   López, Julio ^a   Hankerson, Darrel ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b AUBURN UNIVERSITY   (United States)

Author keywords

Bilinear pairings; Efficient software implementation; Multi core architectures; Parallelization; Vector instructions

Indexed keywords

BILINEAR PAIRING; MULTICORE ARCHITECTURES; PARALLELIZATION; PARALLELIZATIONS; SOFTWARE IMPLEMENTATION;

COMPUTATION THEORY; CRYPTOGRAPHY; VECTORS;

COMPUTER SOFTWARE;

EID: 77952023378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11925-5_7     Document Type: Conference Paper

References (21)

1. Barreto, P.S.L.M., Gailbraith, S., Ó hÉigeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Design, Codes and Cryptography 42(3), 239-271 (2007)
2. Wechsler, O.: Inside Intel Core Microarchitecture: Setting new standards for energy-efficient performance. Technology@Intel Magazine (2006)
3. Grabher, P., Groszschaedl, J., Page, D.: On Software Parallel Implementation of Cryptographic Pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) Selected Areas in Cryptography. LNCS, vol. 5381, pp. 34-49. Springer, Heidelberg (2009)
4. Hankerson, D., Menezes, A., Scott, M.: Identity-Based Cryptography, ch. 12, pp. 188-206. IOS Press, Amsterdam (2008)
5. Intel 64 and IA-32 Architectures Software Developer's Manual Volume2: Instruction Set Reference, http://www.intel.com/Assets/PDF/manual/253666.pdf
6. Gueron, S., Kounavis, M.E.: Carry-Less Multiplication and Its Usage for Computing The GCM Mode. White paper, http://software.intel.com/
7. Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Secaucus (2003)
8. Fong, K., Hankerson, D., López, J., Menezes, A.: Field inversion and point halving revisited. IEEE Transactions on Computers 53(8), 1047-1059 (2004)
9. Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers (in Russian). Doklady Akad. Nauk SSSR 145, 293-294 (1962)
10. m). In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 203-212. Springer, Heidelberg (2000)
11. Beuchat, J., López-Trejo, E., Martínez-Ramos, L., Mitsunari, S., Rodríguez-Henríquez, F.: Multi-core implementation of the Tate pairing over supersingular elliptic curves. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 413-432. Springer, Heidelberg (2009)
12. Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient Implementation of Pairing-Based Cryptosystems. Journal of Cryptology 17(4), 321-334 (2004)
13. 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)
14. Miller, V.S.: The Weil Pairing, and Its Efficient Calculation. Journal of Cryptology 17(4), 235-261 (2004)
15. Hess, F., Smart, N.P., Vercauteren, F.: The eta pairing revisited. IEEE Trans. on Information Theory 52, 4595-4602 (2006)
16. Lee, H., Lee, E., Park, C.: Efficient and Generalized Pairing Computation on Abelian Varieties. IEEE Trans. on Information Theory 55(4), 1793 - 1803 (2009)
17. Mitsunari, S.: A Fast Implementation of ηT Pairing in Characteristic Three on Intel Core 2 Duo Processor. Cryptology ePrint Archive, Report 2009/032 (2009)
18. Cesena, E.: Pairing with Supersingular Trace Zero Varieties Revisited. Cryptology ePrint Archive, Report 2008/404 (2008)
19. Cesena, E., Avanzi, R.: Trace Zero Varieties in Pairing-based Cryptography. In: Conference on Hyperelliptic curves, discrete Logarithms, Encryption, etc. (2009), http://inst-mat.utalca.cl/chile2009/Slides/Roberto- Avanzi-2.pdf
20. Vercauteren,F.:Optimalpairings.Cryptology ePrint Archive, Report2008/096(2008)
21. 3m. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 297-315. Springer, Heidelberg (2008)