| GF(2n)域上基于ONB的ECC芯片设计与实现 |
| |
| 引用本文： | 陈韬,郁滨.GF(2n)域上基于ONB的ECC芯片设计与实现[J].计算机工程与应用,2007,43(8):95-98. |
| |
| 作者姓名： | 陈韬 郁滨 |
| |
| 作者单位： | 解放军信息工程大学,电子技术学院,郑州,450004;解放军信息工程大学,电子技术学院,郑州,450004 |
| |
| 摘 要： | 分析了GF(2~n)域上的椭圆曲线的运算法则,提出了一种串-并行结构的基于优化正规基(ONB)的高速有限域运算单元,比较了域划分D对芯片实现速度和硬件资源占用的影响,完成了域GF(2191)上基于ONB的ECC芯片快速实现。FPGA验证表明,GF(2191)域上一次点加运算需要183个时钟,一次点倍运算需要175个时钟,完成一次求乘法逆运算的总时钟数为133。在50MHz时钟下,完整的点乘运算速度平均为981次/s。
|
| 关 键 词： | 椭圆曲线 优化正规基 点乘运算 ECC |
| 文章编号： | 1002-8331（2007）08-0095-04 |
| 修稿时间： | 2006-06 |
Design and implementation of ECC chip based on ONB over GF(2n) |
| |
| CHEN Tao,YU Bin.Design and implementation of ECC chip based on ONB over GF(2n)[J].Computer Engineering and Applications,2007,43(8):95-98. |
| |
| Authors: | CHEN Tao YU Bin |
| |
| Affiliation: | Institute of Electronic Technology,the PLA Information Engineering University,Zhengzhou 450004,China |
| |
| Abstract: | This paper analyzes the elliptic curves operation rules,presents a high speed serial-parallel elliptic curve multiplier for the Galois field GF(2~n) which based on optimal normal basis,compares the ECC chip speed and hardware resource consuming induced by the different field partition.The proposed multiplier requires 183 clocks for point addition,175 clocks for point doubling and 133 clocks for multiplicative inverse computing.The rate of point multiplication is about 981 per second after FPGA validation. |
| |
| Keywords: | elliptic curve optimal normal base point multiplication operation ECC |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
