| GF(2n)域上基于ONB的ECC运算单元设计与实现 |
| |
| 引用本文： | 陈 韬,郁 滨.GF(2n)域上基于ONB的ECC运算单元设计与实现[J].计算机工程,2007,33(9):168-170. |
| |
| 作者姓名： | 陈 韬 郁 滨 |
| |
| 作者单位： | 解放军信息工程大学电子技术学院,郑州450004 |
| |
| 摘 要： | 分析了GF(2n)域上基于优化正规基(ONB)的椭圆曲线的运算法则，讨论了域划分对芯片实现速度和硬件资源占用二者的影响，设计了一种串-并行结构的基于ONB的高速有限域运算单元，用于完成GF(2191)域上基于ONB的ECC芯片实现，在50MHz时钟下，GF(2191)域上的点乘运算速度平均为981次/s。
|
| 关 键 词： | 椭圆曲线 优化正规基 点乘运算 ECC |
| 文章编号： | 1000-3428（2007）09-0168-03 |
| 修稿时间： | 2006-06-16 |
Design and Implementation of ECC Algorithm Unit Based on ONB over GF(2n) |
| |
| CHEN Tao,YU Bin.Design and Implementation of ECC Algorithm Unit Based on ONB over GF(2n)[J].Computer Engineering,2007,33(9):168-170. |
| |
| Authors: | CHEN Tao YU Bin |
| |
| Affiliation: | Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004 |
| |
| Abstract: | Based on optimal normal basis in GF(2n),a high speed serial-parallel elliptic curve multiplier is proposed in the paper,through introduction of operation rules in GF(2n),elliptic curves and point operation rules,with emphasis on the discussion of the ECC chip speed and hardware resource consuming,which is induced by different field partitions.The rate of point multiply is about 981 per second after FPGA validation. |
| |
| Keywords: | Elliptic curve Optimal normal base Point multiplication operation ECC |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
