| 基于Knuth与Karatsuba乘法的大整数乘法研究 |
| |
| 引用本文： | 韩猛,方贤进,郭玉秀,李涛.基于Knuth与Karatsuba乘法的大整数乘法研究[J].安徽理工大学学报(自然科学版),2008,28(2). |
| |
| 作者姓名： | 韩猛 方贤进 郭玉秀 李涛 |
| |
| 作者单位： | 安徽理工大学计算机科学与技术学院,安徽,淮南,232001 |
| |
| 摘 要： | 在RSA、Diffie-Hellman密码系统的算法中都要用到大整数乘法算术。介绍了Knuth经典乘法、Karatsuba乘法以及它们的计算时间复杂性,在此基础上提出了一个新的大整数乘法技巧,并且在理论上和实践上被证明是有效的。实验结果也显示改进的大整数乘法算法在实现大整数乘法运算时具有更高的效率。
|
| 关 键 词： | Knuth乘法 Karatsuba乘法 大整数乘法 分治法 |
Research on Large Integer Multiplication Based on Knuth and Karatsuba Multiplication |
| |
| HAN Meng,FANG Xian-jin,GUO Yu-xiu,LI Tao.Research on Large Integer Multiplication Based on Knuth and Karatsuba Multiplication[J].Journal of Anhui University of Science and Technology:Natural Science,2008,28(2). |
| |
| Authors: | HAN Meng FANG Xian-jin GUO Yu-xiu LI Tao |
| |
| Abstract: | Algorithms in cryptosystem such as RSA and Diffie-Hellman require large integer multiplication.In the paper Knuth classical multiplication,Karatsuba multiplication and their time complexity were presented,on the basis of which a new large integer multiplication trick was put forward and proved available in theory and practice.The experiment showed that the improved multiplication algorithm is more efficient in implementation of large integer multiplication. |
| |
| Keywords: | Knuth multiplication Karatsuba multiplication large integer multiplication divide and conquer |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
