期刊文献+

可扩展双域模乘器设计与研究 被引量:2

Design and research of dual-field scalable modular multiplier
原文传递
导出
摘要 提出一种可扩展同时支持双域的模乘单元体系结构,通过调整内部运算单元的相关参数,可以满足侧重于性能或成本的不同应用.首先从基于字的双域蒙哥马利算法出发,提出模乘单元的基本体系结构;然后考虑了性能优化的两种不同思路与提高工作频率之间的相互折衷和平衡.由于高度统一的算法和紧密结合的模块结构,使得该可扩展双域模乘单元可以同时支持素数域与二进制域两个域的模乘运算,这一点在进行椭圆曲线密码(ECC)运算时尤为重要.最后以256bit素域模乘为例验证本设计,结果表明该可扩展双域模乘单元既可以降低开销,保持合理的可接受性能,又可以提高硬件开销以完全发挥性能潜力. The architecture of high‐performance scalable modular multiplier on dual‐field was pro‐posed .Various applications focused on either performance or cost could be satisfied by adjusting the parameter of scalable arithmetic units .Firstly the basic architecture of multiplier was proposed based on the word‐based Montgomery algorithm ,and then the two approaches of performance improvement and their trade‐off between working frequencies were discussed .Moreover ,with integration of dual‐field from algorithm to structure ,modular multiplication over both prime and binary fields could be supported ,which was valuable to elliptic curve cryptography (ECC) .At last ,evaluation shows that for 256 bit modular multiplication over prime field ,low cost with reasonable performance or ultra high performance with additional cost both can be achieved according to different configurations .
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2015年第9期51-54,共4页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
关键词 超大规模集成电路 蒙哥马利模乘 流水线处理系统 公钥密码学 可扩展性 very large scale intergration Montgomery modular multiplier pipeline processing sys-tem public key cryptography scalability
  • 相关文献

参考文献11

  • 1Diffie W,Hellman M E.New directions in cryptography[J].IEEE Trans Information Theory,1976,22:644-654.
  • 2IEEE.IEEE 1363—2000standard specifications for public-key cryptography[S].New York:IEEE Computer Society,2000.
  • 3Lopez J,Dahab R.Improved algorithms for elliptic curve arithmetic in GF(2m)[C]∥Proceedings of the Selected Areas in Cryptography.Heidelberg:Springer-Verlag,1998:201-212.
  • 4Montgomery P L.Modular multiplication without trial division[J].Math Computation,1985,44(7):519-521.
  • 5Wallace C S.A suggestion for a fast multiplier[J].IEEE Transactions on Electronic Computers,1964,EC-13(1):14-17.
  • 6陈光化,朱景明,刘名,曾为民.双有限域模乘和模逆算法及其硬件实现[J].电子与信息学报,2010,32(9):2095-2100. 被引量:7
  • 7邬贵明,谢向辉,吴东,郑方,严忻恺.高基Montgomery模乘阵列结构设计与实现[J].计算机工程与科学,2014,36(2):201-205. 被引量:5
  • 8郭晓,蒋安平,宗宇.SM2高速双域Montgomery模乘的硬件设计[J].微电子学与计算机,2013,30(9):17-21. 被引量:11
  • 9韩炼冰,黄锐,段俊红,王松,房利国.基于FPGA的素域模乘快速实现方法[J].信息安全与通信保密,2013,11(9):76-78. 被引量:5
  • 10Shieh M D,Lin W C.Word-based montgomery modular multiplication algorithm for low-latency scalable architectures[J].IEEE Transactions on Computers,2010,59(8):1145-1151.

二级参考文献40

  • 1汪朝晖,陈建华,涂航,李莉.素域上椭圆曲线密码的高效实现[J].武汉大学学报(理学版),2004,50(3):335-338. 被引量:13
  • 2赵学秘,陆洪毅,戴葵,童元满,王志英.一种高性能大数模幂协处理器SEA[J].计算机研究与发展,2005,42(6):924-929. 被引量:7
  • 3刘强,佟冬,程旭.一款RSA模乘幂运算器的设计与实现[J].电子学报,2005,33(5):923-927. 被引量:11
  • 4史焱,吴行军.高速双有限域加密协处理器设计[J].微电子学与计算机,2005,22(5):8-12. 被引量:14
  • 5Hankerson D,Menezes A,and Vanstone S.Guide to Elliptic Curve Cryptography.New York:Springer Verlag New York Inc,2004:25-147.
  • 6Savas E and Koc C K.A scalable and unified multiplier architecture for finite fields GF(P) and GF(2m).Cryptographic Hardware and Embedded Systems(CHES) 2000,Worcester,MA,USA,Augst 17-18,2000:277-292.
  • 7Chiou C W,Lee C Y,and Lin J M.Unified dual-field multiplier in GF(P) and GF(2k).Information Security,2009,3(2):45-52.
  • 8Wang Jian and Jiang An-ping.A high-speed dual field arithmetic unit and hardware implementation,ASICON'07,Guilin,China,Oct.22-25,2007:213-216.
  • 9Ma Shi-wei,Hao Yuan-ling,and Pan Zhong-qiao.Fast implementation for modular inversion and scalar multiplication in the elliptic curve cryptography,IITA '08,Beijing,China,Dec.20-22,2008:488-492.
  • 10Yan Xiao-dong and Li Shu-guo.Modified modular inversion algorithm for VLSI implementation,ASICON'07,Guilin,China,Oct.22-25,2007:90-93.

共引文献17

同被引文献10

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部