期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Design of highly efficient elliptic curve crypto-processor with two multiplications over GF(2^(163))
1
作者 DAN Yong-ping ZOU Xue-cheng +2 位作者 LIU Zheng-lin HAN Yu YI Li-hua 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2009年第2期72-79,共8页
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... 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(2^163) 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(2^163) 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
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部