Faster implementation of scalar multiplication on Koblitz curves

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

Volumn 7533 LNCS, Issue , 2012, Pages 177-193

  Aranha, Diego F ^a   Faz Hernández, Armando ^b   López, Julio ^c   Rodríguez Henríquez, Francisco ^b  

^a UNIVERSITY OF BRASILIA   (Brazil)

^b DEPARTAMENTO DE FÍSICA   (Mexico)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Efficient software implementation; Koblitz elliptic curves; scalar multiplication

Indexed keywords

AUTOMORPHISMS; BINARY FIELDS; CLOCK CYCLES; CRYPTOGRAPHIC PROTOCOLS; DESKTOP COMPUTING; ELLIPTIC CURVE; ELLIPTIC CURVE ARITHMETIC; FASTER IMPLEMENTATION; FIELD ARITHMETIC; IMPLEMENTATION STRATEGIES; KOBLITZ CURVES; MULTIPLE POINTS; OPTIMIZED IMPLEMENTATION; PRIME FIELD; RANDOM POINTS; SCALAR MULTIPLICATION; SECURITY LEVEL; SIDE-CHANNEL; SOFTWARE IMPLEMENTATION;

REGULATORY COMPLIANCE; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 84866027969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33481-8_10     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. Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Secaucus (2003)
3. Taverne, J., Faz-Hernández, A., Aranha, D.F., Rodríguez- Henríquez, F., Hankerson, D., López, J.: Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. Journal of Cryptographic Engineering 1(3), 187-199 (2011)
4. Longa, P., Gebotys, C.: Efficient Techniques for High-Speed Elliptic Curve Cryptography. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 80-94. Springer, Heidelberg (2010)
5. 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
6. Brown, M., Hankerson, D., López, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves Over Prime Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 250-265. Springer, Heidelberg (2001)
7. Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 518-535. Springer, Heidelberg (2009)
8. Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-Speed High- Security Signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 124-142. Springer, Heidelberg (2011)
9. Taverne, J., Faz-Hernández, A., Aranha, D.F., Rodríguez- Henríquez, F., Hankerson, D., López, J.: Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 108-123. Springer, Heidelberg (2011)
10. Aranha, D.F., López, J., Hankerson, D.: Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 144-161. Springer, Heidelberg (2010)
11. Bos, J.W., Kleinjung, T., Niederhagen, R., Schwabe, P.: ECC2K-130 on Cell CPUs. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol. 6055, pp. 225-242. Springer, Heidelberg (2010)
12. 2 Using Chinese Remainder Theorem. IEEE Trans. Computers 58(4), 572-576 (2009)
13. Intel: Intel Architecture Software Developer's Manual Volume 2: Instruction Set Reference (2002), http://www.intel.com
14. Firasta, N., Buxton, M., Jinbo, P., Nasri, K., Kuo, S.: Intel AVX: New frontiers in performance improvement and energy efficiency (2008), White paper available at http://software.intel.com/
15. Fog, A.: Instruction tables: List of instruction latencies, throughputs and microoperation breakdowns for Intel, AMD and VIA CPUs (2012), http://www.agner.org/optimize/instruction-tables.pdf
16. Montgomery, P.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers 54(3), 362-369 (2005)
17. Gaudry, P., Brent, R., Zimmermann, P., Thomé, E.: The gf2x binary field multiplication library, https://gforge.inria.fr/projects/gf2x/
18. m) Arithmetic. Cryptology ePrint Archive, Report 2007/192 (2007), http://eprint.iacr.org/
19. m) using normal bases. Inf. Comput. 78(3), 171-177 (1988)
20. Guajardo, J., Paar, C.: Itoh-Tsujii inversion in standard basis and its application in cryptography and codes. Designs, Codes and Cryptography 25(2), 207-216 (2002)
21. Rodríguez-Henríquez, F., Morales-Luna, G., Saqib, N.A., Cruz-Cortés, N.: Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials. Des. Codes Cryptography 45(1), 19-37 (2007)
22. Solinas, J.A.: Efficient Arithmetic on Koblitz Curves. Designs, Codes and Cryptography 19(2-3), 195-249 (2000)
23. 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)
24. Ahmadi, O., Hankerson, D., Rodríguez-Henríquez, F.: Parallel formulations of scalar multiplication on Koblitz curves. Journal of Universal Computer Science 14(3), 481-504 (2008)
25. n). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 201-212. Springer, Heidelberg (1999)
26. n). IEEE Trans. Computers 51(8), 972-975 (2002)
27. Weber, D., Denny, T.: The Solution of McCurley's Discrete Log Challenge. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 458-471. Springer, Heidelberg (1998)
28. Kim, K.H., Kim, S.I.: A new method for speeding up arithmetic on elliptic curves over binary fields. Cryptology ePrint Archive, Report 2007/181 (2007), http://eprint.iacr.org/
29. Birkner, P., Longa, P., Sica, F.: Four-Dimensional Gallant-Lambert- Vanstone Scalar Multiplication. Cryptology ePrint Archive, Report 2011/608 (2011), http://eprint.iacr.org/, http://www.patricklonga.bravehost.com/speed- ecc.html#speed
30. Bernstein, D.J., Lange, T. (eds.): eBACS: ECRYPT Benchmarking of Cryptographic Systems (May 18, 2012), http://bench.cr.yp.to
31. Su, C., Fan, H.: Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication. Inf. Process. Lett. 112(12), 497-502 (2012)
32. Hamburg, M.: Fast and compact elliptic-curve cryptography. Cryptology ePrint Archive, Report 2012/309 (2012), http://eprint.iacr.org/