Efficient software implementation of binary field arithmetic using vector instruction sets

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

Volumn 6212 LNCS, Issue , 2010, Pages 144-161

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

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b AUBURN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING DATA; BINARY FIELDS; CHARACTERISTIC 2; CRITICAL FIELDS; CURVE-BASED CRYPTOGRAPHY; INSTRUCTION SET; LOOKUPS; PARALLEL TABLE LOOKUPS; SECURITY LEVEL; SIMPLE OPERATION; SOFTWARE IMPLEMENTATION; SQUARE ROOTS;

CRYPTOGRAPHY; NETWORK PROTOCOLS; NETWORK SECURITY;

TABLE LOOKUP;

EID: 77955874321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14712-8_9     Document Type: Conference Paper

References (32)

1. Koblitz, N.: CM-Curves with Good Cryptographic Properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.576, pp. 279-287. Springer, Heidelberg (1992)
2. Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, New York (2002)
3. Barreto, P.S.L.M., Galbraith, S., Éigeartaigh, C.O., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designs, Codes and Cryptography 42(3), 239-271 (2007)
4. Misoczki, R., Barreto, P.S.L.M.: Compact McEliece Keys from Goppa Codes. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.5867, pp. 376-392. Springer, Heidelberg (2009)
5. Chen, A.T., Chen, M.S., Chen, T.R., Cheng, C.M., Ding, J., Kuo, E.H., Lee, F.S., Yang, B.Y.: SSE Implementation of Multivariate PKCs on Modern x86 CPUs. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.5747, pp. 33-48. Springer, Heidelberg (2009)
6. Fiskiran, A.M., Lee, R.B.: Fast Parallel Table Lookups to Accelerate Symmetric- Key Cryptography. In: International Symposium on Information Technology: Coding and Computing (ITCC 2005), vol.1, pp. 526-531. IEEE, Los Alamitos (2005)
7. López, J., Dahab, R.: High-Speed Software Multiplication in GF(2m). In: Roy, B.K., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.1977, pp. 203-212. Springer, Heidelberg (2000)
8. Hankerson, D., López, J., Menezes, A.: Software Implementation of Elliptic Curve Cryptography over Binary Fields. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol.1965, pp. 1-24. Springer, Heidelberg (2000)
9. Aranha, D.F., López, J., Hankerson, D.: High-Speed Parallel Software Implementation of the T Pairing. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.5985, pp. 89-105. Springer, Heidelberg (2010)
10. Bernstein, D.J., Lange, T. (ed.): eBACS: ECRYPT Benchmarking of Cryptographic Systems, http://bench.cr.yp.to (accessed May 25, 2010)
11. Hilewitz, Y., Yin, Y.L., Lee, R.B.: Accelerating theWhirlpool Hash Function Using Parallel Table Lookup and Fast Cyclical Permutation. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.5086, pp. 173-188. Springer, Heidelberg (2008)
12. Intel: Intel Architecture Software Developer's Manual: Instruction Set Reference, vol.2 (2002), http://www.intel.com
13. Diefendorff, K., Dubey, P.K., Hochsprung, R., Scales, H.: AltiVec Extension to PowerPC Accelerates Media Processing. IEEE Micro 20(2), 85-95 (2000)
14. AMD Technology: AMD64 Architecture Programmer's Manual: 128-bit and 256- bit XOP, FMA4 and CVT16 Instruction, vol.6, http://support.amd.com/us/Processor- TechDocs/43479.pdf
15. Gueron, S., Kounavis, M.E.: Carry-Less Multiplication and Its Usage for Computing The GCM Mode. White paper, http://software.intel.com/
16. Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Secaucus (2003)
17. Fong, K., Hankerson, D., López, J., Menezes, A.: Field Inversion and Point Halving Revisited. IEEE Transactions on Computers 53(8), 1047-1059 (2004)
18. Avanzi, R.M.: Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic. In: Adams, C.M., Miri, A., Wiener, M.J. (eds.) SAC 2007. LNCS, vol.4876, pp. 138-154. Springer, Heidelberg (2007)
19. Karatsuba, A., Ofman, Y.: Multiplication of Many-Digital Numbers by Automatic Computers. Doklady Akad. Nauk SSSR (145), 293-294 (1962) Translation in Physics-Doklady 7, 595-596 (1963)
20. Certicom Research: SEC 2: Recommended Elliptic Curve Domain Parameters, http://www.secg.org (2000)
21. Hankerson, D., Karabina, K., Menezes, A.: Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields. IEEE Transactions on Computers 58(10), 1411-1420 (2009)
22. Hankerson, D., Menezes, A., Scott, M.: Software Implementation of Pairings. In: Identity-Based Cryptography, pp. 188-206. IOS Press, Amsterdam (2008)
23. Aranha, D.F., Gouvêa, C.P.L.: RELIC is an Efficient LIbrary for Cryptography, http://code.google.com/p/relic-toolkit/
24. 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)
25. Gaudry, P., Thomé, E.: The mpFq library and implementing curve-based key exchanges. In: Software Performance Enhancement of Encryption and Decryption (SPEED 2007), pp. 49-64 (2009), http://www.hyperelliptic.org/ SPEED/record.pdf
26. Certicom Research: SEC 1: Elliptic Curve Cryptography (2000), http://www.secg.org
27. López, J., Dahab, R.: Improved Algorithms for Elliptic Curve Arithmetic in GF(2n). In: Tavares, S.E., Meijer, H. (eds.) SAC 1998. LNCS, vol.1556, pp. 201-212. Springer, Heidelberg (1999)
28. Solinas, J.A.: Efficient Arithmetic on Koblitz Curves. Designs, Codes and Cryptography 19(2-3), 195-249 (2000)
29. López, J., Dahab, R.: Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol.1717, pp. 316-327. Springer, Heidelberg (1999)
30. Lim, C.H., Lee, P.J.: More Flexible Exponentiation with Precomputation. In: Desmedt, Y. (ed.) CRYPTO 1994. LNCS, vol.839, pp. 95-107. Springer, Heidelberg (1994)
31. Gallant, R., Lambert, R., Vanstone, S.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.2139, pp. 190-200. Springer, Heidelberg (2001)
32. Bernstein, D.J.: Batch Binary Edwards. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.5677, pp. 317-336. Springer, Heidelberg (2009)