| F2^n上基于ONB的椭圆曲线乘法器的设计与实现 |
| |
| 引用本文： | 朱璇,陈韬,郁滨.F2^n上基于ONB的椭圆曲线乘法器的设计与实现[J].微电子学与计算机,2005,22(7):184-188. |
| |
| 作者姓名： | 朱璇 陈韬 郁滨 |
| |
| 作者单位： | 解放军信息工程大学电子技术学院,河南郑州450004 |
| |
| 摘 要： | 文章在介绍有限域运算法则，域上椭圆曲线及点的运算法则的基础上，设计了一个F2^n上基于优化正规基的串行椭圆曲线乘法器，其点乘运算速度可达80．87次／秒，为进一步完成椭圆曲线加密系统提供了硬件基础。
|
| 关 键 词： | 椭圆曲线 正规基 点加运算 点倍运算 |
| 文章编号： | 1000-7180（2005）07-184-05 |
| 收稿时间： | 2004-12-25 |
| 修稿时间： | 2004年12月25 |
The Design and Implementation of an Elliptic Curve Multiplier Based on ONB in F2^n |
| |
| Zhu Xuan;Chen Tao;Yu Bin.The Design and Implementation of an Elliptic Curve Multiplier Based on ONB in F2^n[J].Microelectronics & Computer,2005,22(7):184-188. |
| |
| Authors: | Zhu Xuan;Chen Tao;Yu Bin |
| |
| Abstract: | A serial elliptic curve multiplier based on optimal normal basis in F2^n is carried out in the paper, through introduction of operation rules in Galois Field, elliptic curves and point operation rules. The rate of point multiply is about 80.87 per second. A well hardware basis for the completion of an elliptic curve cryptosystem is provided by the paper. |
| |
| Keywords: | Elliptic Curve Optimal Normal Base Point Add Operation Point Double Operation |
| 本文献已被 维普 等数据库收录！ |
