摘要
Montgomery算法作为一种快速大数模乘算法,常被应用于RSA、ElGamal等公钥密码算法的基本运算。对Montgomery算法进行了深入的剖析,系统地进行了理论推导,通过实验应用分析比较了两种有代表性的优化方案,并针对性地给出了其他方面的一些改进建议。
Montgomery algorithm is a fast modular multiplication algorithm and has been widely used in the base operation of public-key cryptography algorithms such as RSA and ElGamal. The algorithm is analyzed deeply and deduced systematically in this paper. Then, two typical methods is realized and compared, and two other improvements is given.
出处
《科学技术与工程》
2006年第12期1628-1631,共4页
Science Technology and Engineering
基金
南京市软件发展资金(2004软资116号)资助
