High-Speed elliptic curve cryptography accelerator for koblitz curves

Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08

Volumn , Issue , 2008, Pages 109-118

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

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

ELLIPTIC CURVE CRYPTOGRAPHIES; FAST COMPUTATIONS; HIGH-SPEED; JOINT SPARSE FORMS; KOBLITZ CURVES; MULTIPLE POINTS; OPTIMIZED OPERATIONS; POINT MULTIPLICATIONS; PROCESSING UNITS; WINDOW METHODS;

COMPUTERS;

EID: 60349112293     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FCCM.2008.30     Document Type: Conference Paper

References (27)

1. E. Al-Daoud, R. Mahmod, M. Rushdan, and A. Kilicman. A new addition formula for elliptic curves over GF(2n). IEEE Trans. Comput., 51(8):972-975, Aug. 2002.
2. Altera. Stratix II device handbook. Datasheet, vol. 1-2, ver. 4.1, Apr. 2006.
3. B. B. Brumley. Efficient three-term simultaneous elliptic scalar multiplication with applications. In Proc. 11th Nordic Workshop Secure IT Systems, NordSec 2006, pages 105- 116, Link̈oping, Sweden, Oct. 19-20, 2006.
4. B. B. Brumley. Left-to-right signed-bit τ -adic representations of n integers. In Proc. 8th Int. Conf. Information and Communications Security, ICICS 2006, volume 4307 of Lecture Notes in Comput. Sci., pages 469-478. Springer, 2006.
5. C. Candolin, J. Lundberg, and H. Kari. Packet level authentication in military networks. In Proc. 6th Australian Information Warfare & IT Security Conf., Geelong, Australia, Nov. 2005.
6. Certicom Research. SEC 2: Recommended elliptic curve domain parameters. Standards for Efficient Cryptography, Sept. 20, 2000.
7. W. N. Chelton and M. Benaissa. Fast elliptic curve cryptography on FPGA. IEEE Trans. VLSI Syst., 16(2):198-205, Feb. 2008.
8. M. Ciet, T. Lange, F. Sica, and J.-J. Quisquater. Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms. In Advances in Cryptology, EUROCRYPT 2003, volume 2656 of Lecture Notes in Comput. Sci., pages 388-400. Springer, 2003.
9. V. S. Dimitrov, K. U. J̈arvinen, 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 2006, volume 4249 of Lecture Notes in Comput. Sci., pages 445- 459. Springer, 2006.
10. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31(4):469-472, July 1985.
11. J. Goodman and A. Chandrakasan. An energy-efficient reconfigurable public-key cryptography processor. IEEE J. Solid-State Circuits, 36(11):1808-1820, Nov. 2001.
12. M. A. Hasan. Look-up table-based large finite field multiplication in memory constrained cryptosystems. IEEE Trans. Comput., 49(7):749-758, July 2000.
13. T. Itoh and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Inform. Comput., 78(3):171-177, Sept. 1988.
14. K. J̈arvinen, J. Forsten, and J. Skytẗa. Efficient circuitry for computing τ -adic non-adjacent form. In Proc. 13th IEEE Int. Conf. Electronics, Circuits and Systems, ICECS 2006, pages 232-235, Nice, France, Dec. 10-13, 2006.
15. K. J̈arvinen, J. Forsten, and J. Skytẗa. FPGA design of selfcertified signature verification on Koblitz curves. In Cryptographic Hardware and Embedded Systems, CHES 2007, volume 4727 of Lecture Notes in Comput. Sci., pages 256- 271. Springer, 2007.
16. K. J̈arvinen and J. Skytẗa. Fast point multiplication on Koblitz curves: Parallelization method and implementations. Microproc. Microsyst. submitted.
17. K. J̈arvinen and J. Skytẗa. On parallelization of high-speed processors for elliptic curve cryptography. IEEE Trans. VLSI Syst. in press.
18. N. Koblitz. Elliptic curve cryptosystems. Math. Comput., 48:203-209, 1987.
19. N. Koblitz. CM-curves with good cryptographic properties. In Advances in Cryptology, CRYPTO '91, volume 576 of Lecture Notes in Comput. Sci., pages 279-287. Springer, 1991.
20. J. L'opez and R. Dahab. Improved algorithms for elliptic curve arithmetic in GF(2n). In Selected Areas in Cryptography, SAC'98, volume 1556 of Lecture Notes in Comput. Sci., pages 201-212. Springer, 1999.
21. J. Lutz and A. Hasan. High performance FPGA based elliptic curve cryptographic co-processor. In Proc. Int. Conf. Information Technology: Coding and Computing, ITCC 2004, volume 2, pages 486-492, Las Vegas, NV, USA, Apr. 5-7, 2004.
22. G. Meurice de Dormale and J.-J. Quisquater. High-speed hardware implementations of elliptic curve cryptography: A survey. J. Syst. Architect., 53(2-3):72-84, Feb.-Mar. 2007.
23. V. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology, CRYPTO 1985, volume 218 of Lecture Notes in Comput. Sci., pages 417-426. Springer, 1986.
24. National Institute of Standards and Technology (NIST). Digital signature standard (DSS). Federal Information Processing Standard, FIPS PUB 186-2, Jan. 27, 2000.
25. S. Okada, N. Torii, K. Itoh, and M. Takenaka. Implementation of elliptic curve cryptographic coprocessor over GF(2m) on an FPGA. In Cryptographic Hardware and Embedded Systems, CHES 2000, volume 1965 of Lecture Notes in Comput. Sci., pages 25-40. Springer, 2000.
26. J. A. Solinas. Efficient arithmetic on Koblitz curves. Des. Codes Cryptography, 19(2-3):195-249, 2000.
27. T. Wollinger, J. Guajardo, and C. Paar. Security on FPGAs: State-of-the-art implementations and attacks. ACM Trans. Embed. Comput. Syst., 3(3):534-574, Aug. 2004.