期刊文献+

基于改进x^2^n次方器的二进制域快速模逆 被引量:3

A Fast Modular Inversion Architecture over GF(2^m)Based Modified x^2^n Units
下载PDF
导出
摘要 研究椭圆曲线加密算法(ECC)中模逆运算的硬件结构.实现了2个基于Itoh-Tsujii算法(ITA)的模逆硬件结构,最小时钟周期模逆结构(LCC)和高速模逆结构(HS),两种结构均使用简化为非迭代逻辑的二进制域2n次方器和模乘器,并在Xilinx Virtex-5上实现.综合结果表明,本算法提高了时钟频率,两种结构分别达到了不同场景的最小延迟.LCC结构在GF(2^163)上用9周期完成运算,频率达到126.1 MHz,性能比以往工作提高56%;HS结构在GF(2^193)上用20周期完成两次运算,频率达到177.6 MHz,性能比以往工作提高134%. A high-speed hardware architecture was presented to implement modular inversion operations for the field of elliptic curve cryptograph(ECC)in the paper.Two hardware architectures based on Itoh-Tsujii algorithm(ITA),Least-Cock-Cycle-ITA(LCC-ITA)architecture and high-speed-ITA(HS-ITA)architecture,were built and implemented on Xilinx Virtex-5.In the architectures,power operations and multiplications were simplified into non-iterative logic to speed up modular inversion operations.The test results show that the operating frequencies of both architectures are higher than the work before.LCC-ITA architecture takes nine clock cycles to complete a modular inversion operation with the operating frequency 126.1 MHz over GF(2^163),while HS-ITA architecture takes 20 cycles with the operating frequency 177.6 MHz over GF(2^193).
作者 李佳琨 李喆 张靖奇 高巍 LI Jia-kun;LI Zhe;ZHANG Jing-qi;GAO Wei(School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China)
出处 《北京理工大学学报》 EI CAS CSCD 北大核心 2020年第7期765-770,共6页 Transactions of Beijing Institute of Technology
关键词 Itoh-Tsujii算法ITA 模逆运算 椭圆曲线加密 扩展二进制域GF(2^m) Itoh-Tsujii algorithm(ITA) modular inversion elliptic curve cryptograph(ECC) GF(2^m)
  • 相关文献

参考文献1

二级参考文献1

  • 1Coppersmith D,Odlyzko A,Schroeppel R.Discrete logarithms in GF ( p )[]..1985

同被引文献4

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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