| 1024位RSA算法的FPGA设计研究 |
| |
| 引用本文： | 葛峰,金伟信,段本钦.1024位RSA算法的FPGA设计研究[J].军事通信技术,2009(1). |
| |
| 作者姓名： | 葛峰 金伟信 段本钦 |
| |
| 作者单位： | 解放军理工大学通信工程学院研究生1队;总参谋部第61研究所;总参谋部军事代表局; |
| |
| 摘 要： | 改进了高基免减蒙哥马利(Montgomery)算法,使得乘法和加法的总运算量分别减少了约3%和2%。根据平行并行乘法器,设计了适用于模乘运算的一维阵列组合乘法器。基于高基蒙哥马利算法,设计并仿真了1024位密钥的RSA加/解密系统。
|
| 关 键 词： | 公钥算法 蒙哥马利算法 组合乘法器 |
Design Research of 1024-bit RSA Cryptosystem |
| |
| GE Feng,JIN Wei-xin,DUAN Ben-qin.Design Research of 1024-bit RSA Cryptosystem[J].Journal of Military Communications Technology,2009(1). |
| |
| Authors: | GE Feng JIN Wei-xin DUAN Ben-qin |
| |
| Institution: | 1.Postgraduate Team 1;ICE;PLAUST;Nanjing 210007;China;2.The 61st Research Institute of PLA General Staff Headquarters;Beijing 100039;3.The Military Delegate Bureau of General Staff Headquarters;Tianjin 300140;China |
| |
| Abstract: | The high radix Montgomery modular multiplication algorithm was improved without final subtractions.The new algorithm reduces the total computational complexity by 3% in multiplication and 2% in addition.The one-array combinative multiplication was designed on the basis of the parallel multiplication.Based on the high radix Modular multiplication algorithm,the 1024-bit key RSA cryptosystem was designed and emulated. |
| |
| Keywords: | public key algorithm Montgomery algorithm combinative multiplication |
| 本文献已被 CNKI 等数据库收录！ |
