Design of highly efficient elliptic curve crypto-processor with two multiplications over GF(2163)

doi:10.1016/S1005-8885(08)60206-X

Acta Metallurgica Sinica(English letters) ›› 2009, Vol. 16 ›› Issue (2): 72-79.doi: 10.1016/S1005-8885(08)60206-X

• Wireless • Previous Articles Next Articles

Design of highly efficient elliptic curve crypto-processor with two multiplications over GF(2163)

DAN Yong-ping, ZOU Xue-cheng, LIU Zheng-lin, HAN Yu, YI Li-hua

The Department of Electric Engineering, Zhongyuan University of Technology, Zhengzhou 450007, China

Received:1900-01-01 Revised:1900-01-01 Online:2009-04-30
Contact: DAN Yong-ping

Abstract

Abstract:

In this article, a parallel hardware processor is presented to compute elliptic curve scalar multiplication in polynomial basis representation. The processor is applicable to the operations of scalar multiplication by using a modular arithmetic logic unit (MALU). The MALU consists of two multiplications, one addition, and one squaring. The two multiplications and the addition or squaring can be computed in parallel. The whole computations of scalar multiplication over GF(2163) can be performed in 3 064 cycles. The simulation results based on Xilinx Virtex2 XC2V6000 FPGAs show that the proposed design can compute random GF(2163) elliptic curve scalar multiplication operations in 31.17 μs, and the resource occupies 3 994 registers and 15 527 LUTs, which indicates that the crypto-processor is suitable for high-performance application.

Key words:

elliptic curve cryptography;scalar multiplication;finite field;parallel design;high performance

DAN Yong-ping, ZOU Xue-cheng, LIU Zheng-lin, HAN Yu, YI Li-hua. Design of highly efficient elliptic curve crypto-processor with two multiplications over GF(2163)[J]. Acta Metallurgica Sinica(English letters), 2009, 16(2): 72-79.

References

1. IEEE P1363-2000. IEEE Standard Specifications for Public-Key Cryptography. 2000

2. De Dormale G M, Quisquater J J. High-speed hardware implementations of elliptic curve cryptography: a survey. Journal of Systems Architecture, 2007, 53(4): 72-84

3. Rodr?guez-Henr?quez F, Saqib N A, D?az-Perez A. A fast parallel implementation of elliptic curve point multiplication over GF(2^m). Microprocessors and Microsystems, 2004, 28(11): 329-339

4. Shu C, Gaj K, El-Ghazawi T. Low latency elliptic curve cryptography accelerators for NIST curves on binary fields. Proceedings of 2005 IEEE International Conference Field-Programmable Technology, Dec 11-14, 2005, Singapore.Piscataway, NJ, USA: IEEE, 2005: 309-310

5. Sakiyama K, Batina L, Preneel B, et al. Multicore curve-based cryptoprocessor with reconfigurable modular arithmetic logic units over GF(2^n). IEEE Transactions on Computers, 2007, 56(9): 1269-1282

6. Cheung R C C, Telle N J, Luk W, et al. Customizable elliptic curve cryptosystems. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2005, 13(9): 1048-1059

7. Sakiyama K, Batina L, Preneel B, et al. Superscalar coprocessor for high-speed curve-based cryptography. Proceedings of the 8th International Workshop Cryptographic Hardware and Embedded Systems (CHES ’06), Oct 10-13, 2006, Yokohama, Japan. LNCS 4249. Berlin, Germany: Springer-Verlag, 2006: 415–429

8. Sozzani F, Bertoni G, S Turcato, et al. A parallelized design for an elliptic curve cryptosystem coprocessor. Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC’05): Vol 1, Apr 11-13, 2005, Las Vegas, NV, USA. Los Alamitos, CA, USA: IEEE Computer Society, 2005: 626-630

9. López J, Dahab R. Fast multiplication on elliptic curves over GF (2^m) without precomputation. Proceedings of the 1st International Workshop on Cryptographic Hardware and Embedded Systems (CHES’99), Aug 12–13, 1999, Worcester, MA, USA.LNCS 1717.Berlin, Germany: Springer-Verlag, 1999: 316-327

10. Itoh T, Tsujii S. A fast algorithm for computing multiplicative inverses in GF(2^m) using normal bases. Information and Computation, 1988, 78(3): 171-177

11. Song L L, Parhi K K. Low-energy digit-serial/parallel finite field multipliers. Journal of VLSI Digital Processing, 1998, 19(2): 149-166

12. Wu H P. Bit-parallel finite field multiplier and squarer using polynomial basis. IEEE Transactions on Computers, 2002, 51(7): 750-758

Metrics

Comments

Copyright © 2020 The Journal of China Universities of Posts and Telecommunications
　 Adress: P.O. Box 231,Beijing University of Posts and Telecommunications,10 Xi Tucheng Road,Beijing 100876,P.R.China　Post Code: 100081
Tel：86-010-62282493　Fax： 86-010-62283461　E-mail: jchupt@bupt.edu.cn
Support by: Beijing Magtech Co.Ltd

[1]	Wang Gang, Niu Minyao, Fu Fangwei. Construction of compressed sensing matrices based on affine symplectic space over finite fields [J]. JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM, 2018, 25(6): 74-80.
[2]	Chen Shangdi, Tian Wenjing, Li Xue. Construction of authentication codes with distrust arbitration from polynomials over finite fields [J]. JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM, 2017, 24(1): 87-95.
[3]	Chen ShangDi. Two constructions of A3-codes from projective geometry in finite fields [J]. Acta Metallurgica Sinica(English letters), 2015, 22(2): 52-59.

Design of highly efficient elliptic curve crypto-processor with two multiplications over GF(2163)

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 3

Recommended Articles

Metrics

Comments