首页 | 本学科首页   官方微博 | 高级检索  
     

基于FPGA的有限域乘法算法的分析和比较
引用本文:鲍可进,郑博.基于FPGA的有限域乘法算法的分析和比较[J].计算机工程,2008,34(23):247-248.
作者姓名:鲍可进  郑博
作者单位:江苏大学计算机学院,镇江,212013
摘    要:介绍椭圆曲线密码系统和超椭圆曲线密码系统中的乘法模块,在现有的3种乘法算法基础上,设计乘法的硬件框图,并用VHDL语言加以实现,同时对其实现速度和芯片面积进行比较。实验结果表明,在4个不同乘法器的实现方案中,8 bit串并混合乘法器的整体性能较优。

关 键 词:现场可编程门阵列  椭圆曲线密码系统  超椭圆曲线密码系统

Analysis and Comparison of Finite Field Multiplier Algorithm Based on FPGA
BAO Ke-jin,ZHENG Bo.Analysis and Comparison of Finite Field Multiplier Algorithm Based on FPGA[J].Computer Engineering,2008,34(23):247-248.
Authors:BAO Ke-jin  ZHENG Bo
Affiliation:(College of Computer, Jiangsu University, Zhenjiang 212013)
Abstract:A multiplier module in Elliptic Curve Cryptosystem(ECC) and Hyper-Elliptic Curve Cryptosystem(HECC) is introduced. On the basis of three existed multiplier algorithms, the hardware configuration is designed and implemented by using VHDL. Moreover, the speed of implementation and the chip area are compared separately. Experimental results show the 8 bit parallel mixed multiplier has better performance than other multipliers.
Keywords:Field Programmable Gate Array(FPGA)  Elliptic Curve Cryptosystem(ECC)  Hyper-Elliptic Curve Cryptosystem(HECC)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号