| 基于Ⅱ型ONB并行乘法器的设计与实现 |
| |
| 引用本文： | 齐鹏,孙万忠,戴紫彬,张永福.基于Ⅱ型ONB并行乘法器的设计与实现[J].计算机工程,2009,35(4):131-132. |
| |
| 作者姓名： | 齐鹏 孙万忠 戴紫彬 张永福 |
| |
| 作者单位： | 解放军信息工程大学电子技术学院,郑州,450004 |
| |
| 摘 要： | 在椭圆曲线密码体制中，有限域的乘法运算是最关键的运算。基于Ⅱ型正规基域的加法运算速度快、乘方运算简单，但乘法运算比较复杂，成为该域上运算的瓶颈。为了解决这个问题，该文在分析串行乘法算法的基础上对算法进行改进，该算法与串行乘法算法相比，减少了运算周期，有效地提高了运行速度，根据改进算法设计并行乘法器结构，并在FPGA上进行实现，为进一步提高椭圆曲线加密速度提供硬件基础。
|
| 关 键 词： | 有限域 正规基 椭圆曲线 乘法器 |
| 修稿时间： | |
Design and Implementation of Parallel Multiplier Based on Optimal Normal Basis of Type II |
| |
| QI Peng,SUN Wan-zhong,DAI Zi-bin,ZHANG Yong-fu.Design and Implementation of Parallel Multiplier Based on Optimal Normal Basis of Type II[J].Computer Engineering,2009,35(4):131-132. |
| |
| Authors: | QI Peng SUN Wan-zhong DAI Zi-bin ZHANG Yong-fu |
| |
| Affiliation: | Institute of Electronic Technology;PLA Information Engineering University;Zhengzhou 450004 |
| |
| Abstract: | Multiplication operation over the finite field is the most crucial part in the elliptic curve cryptosystems.It operates a faster addition and simpler square with the elements representing on the finite field,but the comparison of the multiplication has become the bottleneck of operation.To solve this problem,This paper puts forward a modified scheme based on analyzing serial multiplication,with which compared the scheme reduces the operation cycles greatly,enhances the speed efficiently,and designs the para... |
| |
| Keywords: | finite field normal basis elliptic curve multiplicatier |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
