中国邮电高校学报(英文) ›› 2009, Vol. 16 ›› Issue (2): 72-79.doi: 10.1016/S1005-8885(08)60206-X

• Information Security • 上一篇    下一篇

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

但永平, ZOU Xue-cheng, LIU Zheng-lin, HAN Yu, YI Li-hua   

  1. The Department of Electric Engineering, Zhongyuan University of Technology, Zhengzhou 450007, China
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-30
  • 通讯作者: 但永平

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   

  1. 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

摘要:

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.

关键词:

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

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