Fast point multiplication on Koblitz curves: Parallelization method and implementations

Microprocessors and Microsystems

Volumn 33, Issue 2, 2009, Pages 106-116

  Järvinen, Kimmo ^a   Skyttä, Jorma ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Elliptic curve cryptography; Field programmable gate array; Koblitz curves; Parallelism

Indexed keywords

CRYPTOGRAPHY; LOGIC GATES; OPTICAL SENSORS;

EFFICIENT IMPLEMENTATIONS; ELLIPTIC CURVE CRYPTOGRAPHY; ELLIPTIC CURVE CRYPTOSYSTEM; FPGA IMPLEMENTATIONS; KOBLITZ CURVES; PARALLELISM; PARALLELIZATION; POINT MULTIPLICATIONS; STANDARDIZED CURVES;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 62249110288     PISSN: 01419331     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.micpro.2008.08.002     Document Type: Article

References (42)

1. Koblitz N. Elliptic curve cryptosystems. Math. Comput 48 (1987) 203-209
2. V. Miller, Use of elliptic curves in cryptography, in: Advances in Cryptology, CRYPTO'85, Lecture Notes in Computer Science, vol. 218, Springer, 1985, pp. 417-426.
3. I. Blake, G. Seroussi, N. Smart, Elliptic Curves in Cryptography, London Mathematical Society Lecture Notes Series, vol. 265, Cambridge University Press, 1999.
4. H. Eberle, N. Gura, S. Chang Shantz, V. Gupta, L. Rarick, S. Sundaram, A public-key cryptographic processor for RSA and ECC, in: Proceedings of the IEEE International Conference Application-Specific Systems, Architectures and Processors, ASAP'04, Galveston, TX, USA, 2004, pp. 98-110.
5. Goodman J., and Chandrakasan A. An energy-efficient reconfigurable public-key cryptography processor. IEEE J. Solid-State Circuits 36 11 (2001) 1808-1820
6. F. Sozzani, G. Bertoni, S. Turcato, L. Breveglieri, A parallelized design for an elliptic curve cryptosystem coprocessor, in: Proceedings of the International Conference Information Technology: Coding and Computing, ITCC 2005, vol. 1, Las Vegas, NV, USA, 2005, pp. 626-630.
7. Wollinger T., Guajardo J., and Paar C. Security on FPGAs: state-of-the-art implementations and attacks. ACM Trans. Embed. Comput. Syst. 3 3 (2004) 534-574
8. B. Ansari, M.A. Hasan, High performance architecture of elliptic curve scalar multiplication, Tech. Rep. CORR 2006-01, University of Waterloo, Canada, 2006.
9. V.S. Dimitrov, K.U. Järvinen, M.J. Jacobson, W.F. Chan, Z. Huang, FPGA implementation of point multiplication on Koblitz curves using Kleinian integers, in: Cryptographic Hardware and Embedded Systems, CHES 2006, Lecture Notes in Computer Science, vol. 4249, Springer, 2006, pp. 445-459.
10. m), in: Proceedings of the IEEE International Conference Application-Specific Systems, Architectures, and Processors, ASAP'03, The Hague, The Netherlands, 2003, pp. 444-454.
11. M. Bednara, M. Daldrup, J. von zur Gathen, J. Shokrollahi, J. Teich, Reconfigurable implementation of elliptic curve crypto algorithms, in: Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS 2002, Reconfigurable Architectures Workshop, RAW 2002, Ft. Lauderdale, FL, USA, 2002, pp. 157-164.
12. M. Bednara, M. Daldrup, J. Teich, J. von zur Gathen, J. Shokrollahi, Tradeoff analysis of FPGA based elliptic curve cryptography, in: Proceedings of the IEEE International Symposium Circuits and Systems, ISCAS 2002, vol. 5, Phoenix-Scottdale, AZ, USA, 2002, pp. 797-800.
13. Cheung R.C.C., Telle N.J., Luk W., and Cheung P.Y.K. Customizable elliptic curve cryptosystem. IEEE Trans. VLSI Syst. 13 (2005) 1048-1059
14. Järvinen K., and Skyttä J. On parallelization of high-speed processors for elliptic curve cryptography. IEEE Trans. VLSI Syst. 16 (2008) 1162-1175
15. K. Järvinen, J. Forsten, J. Skyttä, FPGA design of self-certified signature verification on Koblitz curves, in: Cryptographic Hardware and Embedded Systems, CHES 2007, Lecture Notes in Computer Science, vol. 4727, Springer, 2007, pp. 256-271.
16. J. Lutz, A. Hasan, High performance FPGA based elliptic curve cryptographic co-processor, in: Proceedings of the International Conference Information Technology: Coding and Computing, ITCC 2004, vol. 2, Las Vegas, NV, USA, 2004, pp. 486-492.
17. m) on an FPGA, in: Cryptographic Hardware and Embedded Systems, CHES 2000, Lecture Notes in Computer Science, vol. 1965, Springer, 2000, pp. 25-40.
18. m). Microprocess. Microsy 28 5-6 (2004) 329-339
19. K. Sakiyama, L. Batina, B. Preneel, I. Verbauwhede, Superscalar coprocessor for high-speed curve-based cryptography, in: Cryptographic Hardware and Embedded Systems, CHES 2006, Lecture Notes in Computer Science, vol. 4249, Springer, 2006, pp. 415-429.
20. C. Shu, K. Gaj, T. El-Ghazawi, Low latency elliptic curve cryptography accelerators for NIST curves over binary fields, in: Proceedings of the IEEE International Conference Field Programmable Technology, FPT 2005, Singapore, 2005, pp. 309-310.
21. Meurice de Dormale G., and Quisquater J.-J. High-speed hardware implementations of elliptic curve cryptography: a survey. J. Syst. Architect. 53 2-3 (2007) 72-84
22. Hankerson D., Menezes A., and Vanstone S. Guide to Elliptic Curve Cryptography (2004), Springer
23. m) without precomputation, in: Cryptographic Hardware and Embedded Systems, CHES 1999, Lecture Notes in Computer Science, vol. 1717, Springer, 1999, pp. 316-317.
24. N. Koblitz, CM-curves with good cryptographic properties, in: Advances in Cryptology, CRYPTO'91, Lecture Notes in Computer Science, vol. 576, Springer, 1991, pp. 279-287.
25. National Institute of Standards and Technology (NIST), Digital signature standard (DSS), Federal Information Processing Standard, FIPS PUB 186-2, January 27, 2000.
26. Certicom Research, SEC 1: Elliptic curve cryptography, Standards for Efficient Cryptography, September 20, 2000.
27. Certicom Research, SEC 2: Recommended elliptic curve domain parameters, Standards for Efficient Cryptography, September 20, 2000.
28. Montgomery P.L. Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48 177 (1987) 243-264
29. Doche C., and Lange T. Arithmetic of elliptic curves. In: Cohen H., and Frey G. (Eds). Handbook of Elliptic and Hyperelliptic Curve Cryptography (2006), Chapman & Hall/CRC 267-302 Ch. 13
30. n), in: Selected Areas in Cryptography, SAC'98, Lecture Notes in Computer Science, vol. 1556, Springer, 1998, pp. 201-212.
31. n). IEEE Trans. Comput. 51 8 (2002) 972-975
32. m) using normal bases. Inform. Comput. 78 3 (1988) 171-177
33. Solinas J.A. Efficient arithmetic on Koblitz curves. Des. Codes Cryptogr. 19 2-3 (2000) 195-249
34. T. Lange, A note on López-Dahab coordinates, Cryptology ePrint Archive, Report 2004/323, , 2004.
35. m) with FPGA, in: Cryptographic Hardware and Embedded Systems, CHES 2007, Lecture Notes in Computer Science, vol. 4727, Springer, 2007, pp. 378-393.
36. Hasan M.A. Look-up table-based large finite field multiplication in memory constrained cryptosystems. IEEE Trans. Comput. 49 7 (2000) 749-758
37. J. Lutz, High performance elliptic curve cryptographic co-processor, Master's Thesis, University of Waterloo, 2003.
38. m). IEEE Trans. Comput. 34 8 (1985) 709-717
39. K. Järvinen, J. Forsten, J. Skyttä, Efficient circuitry for computing τ-adic non-adjacent form, in: Proceedings of the IEEE International Conference Electronics, Circuits and Systems, ICECS 2006, Nice, France, 2006, pp. 232-235.
40. B.B. Brumley, K. Järvinen, Koblitz curves and integer equivalents of Frobenius expansions, in: Selected Areas in Cryptography, SAC 2007, Lecture Notes in Computer Science, vol. 4876, Springer, 2007, pp. 126-137.
41. Altera, Stratix II Device Handbook, vol. 1-2, ver.4.1, , April 2006.
42. V.S. Dimitrov, K.U. Järvinen, M.J. Jacobson, W.F. Chan, Z. Huang, Provably sublinear point multiplication on Koblitz curves and its hardware implementation, IEEE Trans. Comput., in press, doi:10.1109/TC.2008.65.