On parallelization of high-speed processors for elliptic curve cryptography

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 16, Issue 9, 2008, Pages 1162-1175

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

^a IEEE

^b AALTO UNIVERSITY   (Finland)

Author keywords

Elliptic curve cryptography (ECC); Field programmable gate arrays (FPGAs); Koblitz curves; Parallel processing; Public key cryptography

Indexed keywords

BINARY FIELDS; ELLIPTIC CURVE CRYPTOGRAPHY; ELLIPTIC CURVE CRYPTOGRAPHY (ECC); ELLIPTIC CURVES; FIELD-PROGRAMMABLE GATE ARRAYS (FPGAS); HARDWARE ACCELERATORS; HIGH SPEEDS; KOBLITZ CURVES; PARALLEL PROCESSING; PARALLELIZATION; PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 50549098698     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2008.2000728     Document Type: Article

References (43)

1. N. Koblitz, "Elliptic curve cryptosystems," Math. Comput., vol. 48, pp. 203-209, 1987.
2. V. Miller, "Use of elliptic curves in cryptography," in Advances in Cryptology (CRYPTO), ser. Lecture Notes in Computer Science. New York: Springer, 1986, vol. 218, pp. 417-426.
3. 2155," IEEE J. Sel. Areas Commun., vol. 11, no. 5, pp. 804-813, Jun. 1993.
4. J. Goodman and A. Chandrakasan, "An energy effcient reconfigurable public-key cryptography processor architecture," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 2000, vol. 1965, pp. 175-190.
5. A. Satoh and K. Takano, "A scalable dual-field elliptic curve cryptographic processor," IEEE Trans. Comput, vol. 52, no. 4, pp. 449-460, Apr. 2003.
6. F. Sozzani, G. Bertoni, S. Turcato, and L. Breveglieri, "A parallelized design for an elliptic curve cryptosystem coprocessor," in Proc. Int. Conf. Inf. Technol.: Coding Comput. (ITCC), Las Vegas, NV, Apr. 2005, vol. 1, pp. 626-630.
7. B. Ansari and M. A. Hasan, "High performance architecture of elliptic curve scalar multiplication," Centre for Applied Cryptographic Research, Univ. Waterloo, Waterloo, ON, Canada. Tech. Rep. CACR 2006-1, 2006.
8. n) in Optimal Normal Basis on a Reconfigurable Computer," in Proc. Int. Conf. Field Programmable Logic and Application (FPL), ser. Lecture Notes in Computer Science. New York: Springer, 2004, vol. 3203, pp. 1001-1005.
9. M. Bednara, M. Daldrup, J. von zur Gathen, J. Shokrollahi, and J. Teich, "Reconfigurable implementation of elliptic curve crypto algorithms," in Proc. Int. Parallel Distrib. Process. Symp., (IPDPS, RAW), Ft. Lauderdale, FL, Apr. 2002, pp. 157-164.
10. m) elliptic curve cryptography processors," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 14, no. 6, pp. 659-662, Jun. 2006.
11. R. C. C. Cheung, N. J. Telle, W. Luk, and P. Y. K. Cheung, "Customizable elliptic curve cryptosystem," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 13, no. 9, pp. 1048-1059, Sep. 2005.
12. V. S. Dimitrov, K. U. Järvinen, M. J. Jacobson, W. F. Chan, and Z. Huang, "FPGA implementation of point multiplication on Koblitz curves using Kleinian integers," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 2006, vol. 4249, pp. 445-459.
13. m)," in Proc. IEEE Int. Conf. Appl.-Specific Syst., Arch., Process., (ASAP), The Hague, The Netherlands, Jun. 2003, pp. 444-454.
14. N. Gura, S. C. Shantz, H. Eberle, S. Gupta, V. Gupta, D. Finchelstein, E. Goupy, and D. Stebila, "An end-to-end systems approach to elliptic curve cryptography," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 2002, vol. 2523, pp. 349-365.
15. N. Gura, H. Eberle, and S. C. Shantz, "Generic implementations of elliptic curve cryptography using partial reduction," in Proc. ACM Conf. Comput. Commun. Security (CCS), Washington, DC, Nov. 2002, vol. 1, pp. 108-116.
16. K. Järvinen, M. Tommiska, and J. Skyttä, "A scalable architecture for elliptic curve point multiplication," in Proc. IEEE Int. Conf. Field-Program. Technol. (FPT), Brisbane, Australia, Dec. 2004, pp. 303-306.
17. K. Järvinen, J. Forsten, and J. Skyttä, "FPGA design of self-certified signature verification on Koblitz curves," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 2007, vol. 4727, pp. 256-271.
18. P. H. W. Leong and K. H. Leung, "A microcoded elliptic curve processor using FPGA Technology," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 10, no. 5, pp. 550-559, Oct. 2002.
19. J. Lutz and A. Hasan, "High performance FPGA based elliptic curve cryptographic co-processor," in Proc. Int. Conf. Inf. Technol.: Coding Comput. (ITCC), Las Vegas, NV, Apr. 2004, vol. 2, pp. 486-492.
20. m) on an FPGA," in Cryptographic Hardware and Embedded Systems, CHES 2000, ser. Lecture Notes in Computer Science. New York: Springer, 2000, vol. 1965, pp. 25-40.
21. m)," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 2000, vol. 1965, pp. 41-56.
22. m)," Micmpmcess. Microsyst., vol. 28, no. 5-6, pp. 329-339, Aug. 2004.
23. C. Shu, K. Gaj, and T. El-Ghazawi, "Low latency elliptic curve cryptography accelerators for NIST curves over binary fields," in Proc. IEEE Int. Conf. Field-Program. Technol. (FPT), Singapore, Dec. 2005, pp. 309-310.
24. G. Meurice de Dormale and J.-J. Quisquater, "High-speed hardware implementations of elliptic curve cryptography: A survey," J. Syst. Architect., vol. 53, no. 2-3, pp. 72-84, Feb./Mar. 2007.
25. G. Orlando and C. Paar, "A super-serial Galois fields multiplier for FPGAs and its application to public-key algorithms," in Proc. IEEE Symp. Field-Pmgrammable Custom Computing Machines (FCCM), Napa Valley, CA, Apr. 1999, pp. 232-239.
26. L. Song and K. K. Parhi, "Low-energy digit-serial/parallel finite field multipliers," J. VLSI Signal Process., vol. 19, no. 2, pp. 149-166, Jul. 1998.
27. N. Koblitz, "CM-curves with good cryptographic properties," in Adv. Cryptology (CRYPTO), ser. Lecture Notes in Computer Science. New York: Springer, 1991, vol. 576, pp. 279-287.
28. Digital Signature Standard (DSS), FIPS PUB 186-2, Federal Information Processing Standard, National Institute of Standards and Technology (NIST), Computer Security, Jan. 27, 2000.
29. SEC 2: Recommended Elliptic Curve Domain Parameters, , Standards for Efficient Cryptography, Certicom Research Std., Sep. 20, 2000 [Online]. Available: http://www.secg.org/download/aid-386/sec2_final.pdf
30. D. Hankerson, J. L. Hernandez, and A. Menezes, "Software implementation of elliptic curve cryptography over binary fields," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 2000, vol. 1965, pp. 1-24.
31. C. Doche and T. Lange, "Arithmetic of elliptic curves," in Handbook of Elliptic and Hyperelliptic Curve Cryptography, H. Cohen and G. Frey, Eds. Boca Raton, FL: Chapman & Hall/CRC, 2006, ch. 13, pp. 267-302.
32. D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. New York: Springer, 2004.
33. m) using normal bases," Inform. Comput., vol. 78, no. 3, pp. 171-177, Sep. 1988.
34. m) without precomputation," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 1999, vol. 1717, pp. 316-317.
35. n) using projective coordinates," Inf. Process. Lett., vol. 76, no. 3, pp. 101-103, Dec. 15, 2000.
36. T. Lange, "A note on López-Dahab coordinates," Cryptology ePrint Archive, Tech. Rep. 2004/323, 2004 [Online]. Available: http://eprint.iacr.org/
37. n)," IEEE Trans. Comput., vol. 5.1, no. 8, pp. 972-975, Aug. 2002.
38. J. A. Solinas, "Efficient arithmetic on Koblitz curves," Des. Codes Cryptography, vol. 19, no. 2-3, pp. 195-249, 2000.
39. m),"IEEE Trans. Comput., vol. 34, no. 8, pp. 709-717, Aug. 1985.
40. T. Izu and T. Takagi, "Fast elliptic curve multiplications with SIMD operations," in Proc. Int. Conf. Inf. Commun. Sec. (ICICS), ser. Lecture Notes in Computer Science. New York: Springer, 2002, vol. 2513, pp. 217-230.
41. "Stratix II Device Handbook" ver. 4.1, Altera, San Jose, CA, Apr. 2006 [Online]. Available: http://www.alte.ra.com/literature/hb/stx2/ stratix2_handbook.pdf, vol. 1-2
42. K. Järvinen, J. Forsten, and J. Skyttä, "Efficient circuitry for computing τ-adic non-adjacent form," in Proc. IEEE Int. Conf. Electron., Circuits Syst. (ICECS), Nice, France, Dec. 2006, pp. 232-235.
43. K. Okeya, T. Takagi, and C. Vuillaume, "Short memory scalar multiplication on Koblitz curves," in Cryptographic Hardware and Embedded Systems (CHES), ser. Lecture Notes in Computer Science. New York: Springer, 2005, vol. 3659, pp. 91-105.