期刊文献+

一种适用于FPGA实现的Montgomery模乘设计方法

A Method of Montgomery Modular Multiplication Design Suitable for FPGA
下载PDF
导出
摘要 密码技术是保障信息安全的核心技术,其中公钥密码得到了广泛应用,其基本运算中的乘法运算是最耗时、最关键的运算,设计高效的乘法器对公钥密码的有效实现具有重要意义。为提高公钥密码的计算速率,设计了一种高效且适合于现场可编程门阵列(Field Programmable Gate Array,FPGA)内并行计算、多核调用的Montgomery模乘设计方法,该方法通过预计算的方式减少一次模乘计算耗用的时间,通过查表替代实时计算的方式减少对FPGA内部逻辑资源的占用,详细介绍了所研究、设计的内容及方法的思想、原理和工程实现结果,并从FPGA的资源和速度2个方面与其他文献进行了对比分析,给出了对工作的总结和未来应用展望。 Cryptography is the core technology to ensure information security,in which public key cryptography is widely used,and the multiplication operation in its basic operation is the most timeconsuming and critical operation,so it is of great significance to design and achieve an efficient multiplier for the effective implementation of public key cryptography.In order to improve the computing speed of public key cryptography,this paper proposes a Montgomery modular multiplication method that is efficient and suitable for parallel computing and multi-core invocation in FPGA.The method reduces the time spent on the modular multiplication operation by pre-computing,and reduces the use of logic resources inside the FPGA by replacing real-time computing with table lookup.This paper also describes in detail the idea,principle and implementation method of the scheme,and gives a comparative analysis with other methods in terms of both resources and speed of FPGA,and gives a summary of the work and an outlook for future applications.
作者 刘贺 王小骥 刘星江 杨竞 LIU He;WANG Xiaoji;LIU Xingjiang;YANG Jing(No.30 Institute of CETC,Chengdu Sichuan 610041,China)
出处 《信息安全与通信保密》 2024年第5期54-61,共8页 Information Security and Communications Privacy
关键词 现场可编程门阵列 并行 MONTGOMERY模乘 预计算 FPGA parallel Montgomery modular multiplication pre-computing
  • 相关文献

参考文献7

二级参考文献35

  • 1Montgomery P L.Modular multiplication without trial division[J].Mathematics of Computation,1985,44(170):519-521. 被引量:1
  • 2Tenca A F,Koc C K.A scalable architecture for Montgomery multiplication[C]// Proc of Cryptographic Hardware and Embedded Systems,1999:94-108. 被引量:1
  • 3Huang M,Gaj K,El-Ghazawi T.New hardware architectures for Montgomery modular multiplication algorithm[J].IEEE Transactions on Computers,2011,60(7):923-936. 被引量:1
  • 4McIvor C,McLoone M,McCanny J V.High-radix systolic modular multiplication on reconfigurable hardware[C]//Proc of IEEE International Conference on Field-Programmable Technology,2005:13-18. 被引量:1
  • 5Zhou L,Huang M,Smith S C.High-performance and areaefficient hardware design for radix 2k Montgomery multipliers[C]//Proc of International Conference on Computer Design,2011:1. 被引量:1
  • 6Batina L,Muurling G.Montgomery in practice:How to do it more efficiently in hardware[C]// Proc of Topics in Cryptology,the Cryptographer's Track at the RSA Conference,2002:40-52. 被引量:1
  • 7Walter C D.Montgomery's multiplication technique:How to make it smaller and faster[C]//Proc of Cryptographic Hardware and Embedded Systems,1999:80-93. 被引量:1
  • 8(O)rs S B,Batina L,Preneel B,et al.Hardware implementation of elliptic curve processor over GF (p)[C]// Proc of IEEE International Conference on Application-Specific Systems,Architectures and Processors,2003:433-443. 被引量:1
  • 9Sakiyama K,Mentens N,Batina L,et al.Reconfigurable modular arithmetic logic unit for high-performance public-key cryptosystems[].Int’l Workshop Applied Recon-figurable ComputingARC.2006 被引量:1
  • 10Nadia Nedjah,Luiza de Macedo Mourelle.Three hardware architectures for the binary modular exponentiation:se-quential,parallel and systolic[].IEEE TransCircuits and Systems.2005 被引量:1

共引文献36

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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