Design and Implementation of a Low-Cost Scalar Multiplier-on-Chip for Elliptic Curve Cryptosystem

Abstract:

In the ECC, scalar multiplication represents the core operation of the system. In recent years, the circuit architecture of triple processor cores or greater has been addressed in the domestic and international literature. A parallel processing concept is mainly used in this type of framework to accelerate circuit operation. In the present study, equation calculation and circuit design were employed to integrate the pipeline architecture and the parallel processing architecture and further propose an elliptic curve scalar multiplier for dual processor cores. In addition, a Xilinx XC5VLX110T FPGA was used to verify the accuracy and performance of circuit functions. The maximum frequency was 173 MHz, the number of LUTs was 14999 slices, and the time to accomplishing one scalar multiplication was only 8.8s. Compared to architectures described in recent reports, the architecture presented was faster and effectively reduced the square measure by 28%.

• Periodical: Applied Mechanics and Materials (Volumes 284-287)
• Pages: 3395-3400
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.284-287.3395
• Online since: January 2013
• Authors: Wen Tzeng Huang, Ching Kuo Wang, Guo Ming Sung, Chiu Ching Tuan
• Keywords: Cryptography, Elliptic Curve Cryptosystem, Scalar Multiplier

References

[1] W. Diffie and M.E. Hellman: New Directions in Cryptography, IEEE Trans. on Information Theory, Vol. 22, No. 6 (1976), pp.644-654.

DOI: 10.1109/tit.1976.1055638

[2] N. Koblitz: Elliptic Curve Cryptosystems, Mathematics of Computation, Vol. 48, No. 177 (1987), pp.203-209.

DOI: 10.1090/s0025-5718-1987-0866109-5

[3] V.S. Miller: Use of Elliptic Curves in Cryptography, Advances in Cryptology - CRYPTO '85 (1986), pp.417-426.

DOI: 10.1007/3-540-39799-x_31

[4] J. Huang, H. Li, and P. Sweany: An FPGA Implementation of Elliptic Curve Cryptography for Future Secure Web Transaction, International Conference on Parallel and Distributed Computing Systems (2007), pp.296-301.

[5] J. Seberry and J. Pieprzyk, Cryptography: An Introduction to Computer Security, Prentice Hall. (1986).

[6] D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curves Cryptography, New York: Springer-Verlag Hall/CRC. (2004).

[7] IEEE 1363, Standard Specifications for Publickey Cryptography. (2000).

[8] NIST, Recommended elliptic curves for federal government use, URL: http: /csrc. nist. gov/encryption. (1999).

[9] T. Itoh and S. Tsujii: A Fast Algorithm for Computing Multiplicative Inverses in GF(2m) Using Normal Bases, Information and Computation, Vol. 78, No. 3 (1988), pp.171-177.

DOI: 10.1016/0890-5401(88)90024-7

[10] P.L. Montgomery: Speeding the pollard and elliptic curve methods of factorization, Mathematics of Computation, Vol. 48 (1987), pp.243-264.

DOI: 10.1090/s0025-5718-1987-0866113-7

[11] J. Lòpez and R. Dahab: Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation, Proc. First Int'l Workshop Cryptographic Hardware and Embedded Systems (1999), pp.316-327.

DOI: 10.1007/3-540-48059-5_27

[12] S. Sutikno, A. Surya, and R. Effendi: An Implementation of ElGamal Elliptic Curves Cryptosystems, IEEE Asia-Pacific Conference on Circuits and Systems (1998), pp.483-486.

DOI: 10.1109/apccas.1998.743829

[13] B. Ansari and M.A. Hasan: High performance architecture of elliptic curve scalar multiplication, Tech. Report CACR 2006-01. (2006).

[14] B. Ansari and M.A. Hasan: High-Performance Architecture of Elliptic Curve Scalar Multiplication, IEEE Trans. on Computers, Vol. 57, No. 11 (2008), pp.1443-1452.

DOI: 10.1109/tc.2008.133

[15] H.M. Choi, C.P. Hong, and C.H. Kim: High performance elliptic curve cryptographic processor over GF(2163), Proc. IEEE Int. Symposium on Electronic Design, Test, and Applications (DELTA) (2008), pp.290-295.

DOI: 10.1109/delta.2008.118

[16] J.Y. Lai, T.Y. Hung, and K.H. Yang: High-performance architecture for Elliptic Curve Cryptography over binary field, International Symposium on Circuits and Systems (ISCAS) (2010), pp.3933-3936.

DOI: 10.1109/iscas.2010.5537670

[17] Y. Zhang, D. Chen, Y. Choi, L. Chen, and S.B. Ko: A high performance pseudo-multi-core ECC processor over GF(2163), International Symposium on Circuits and Systems (ISCAS) (2010), pp.701-704.

DOI: 10.1109/iscas.2010.5537486

[18] H. Wu: Bit-parallel finite field multiplier and squarer using polynomial basis, IEEE Trans. on Computers, Vol. 51, No. 7 (2002), pp.750-758.

DOI: 10.1109/tc.2002.1017695