| 基于FPGA的GF(2~m)域求逆算法的设计研究 |
| |
| 引用本文： | 高献伟,欧海文,董秀则,靳济方.基于FPGA的GF(2~m)域求逆算法的设计研究[J].计算机工程与应用,2006,42(9):135-137. |
| |
| 作者姓名： | 高献伟 欧海文 董秀则 靳济方 |
| |
| 作者单位： | 北京电子科技学院,北京,100070 |
| |
| 基金项目： | 北京电子科技学院校科研和教改项目 |
| |
| 摘 要： | 有限域GF(2m)上的椭圆曲线密码体制以其密钥短、安全强度高的优点获得了广泛的重视和应用,该密码体制域运算中最费时的运算是有限域上的求逆运算。论文提出一种基于多项式基乘法和平方的FPGA快速求逆设计方法,并给出了面积与速度的比较分析。
|
| 关 键 词： | 有限域 求逆算法(FPGA) Cyclone VHDL |
| 文章编号： | 1002-8331-（2006）09-0135-03 |
| 收稿时间： | 2005-06 |
| 修稿时间： | 2005-06 |
Research on FPGA Implementation of Algorithm for Computing Inverse in GF(2m) |
| |
| Gao Xianwei,Ou Haiwen,Dong Xiuze,Jin Jifang.Research on FPGA Implementation of Algorithm for Computing Inverse in GF(2m)[J].Computer Engineering and Applications,2006,42(9):135-137. |
| |
| Authors: | Gao Xianwei Ou Haiwen Dong Xiuze Jin Jifang |
| |
| Affiliation: | Beijing Electronic Science and Technology Institute,Beijing 100070 |
| |
| Abstract: | The elliptic curve cryptosystems in the finite field GF(2m) receive considerable attention and are widely used because of their small key size and high security.Inverse over the finite field GF(2m) is the most time consumed arithmetic operation.This paper presents an efficient FPGA implementation for the algorithm for computing inverse based on polynomial basis multiplier and square,and the tradeoff analysis of the inverse with respect to area and performance is also provided. |
| |
| Keywords: | Cyclone VHDL |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
