摘要
大数模乘在密码学领域有广泛的应用,它是实现RSA、ElGamal、Fiat-Shamir等公钥密码算法的基本运算。该文在分析现有模乘算法的基础上,结合滑动窗口技术对Montgomery模乘算法的具体实现及在模幂中的应用进行了改进。理论分析及实验结果表明,该改进能有效提高公钥密码体制的实现速度。
Modular multiplication of larger-number has universal application in cryptography, and it is the base operation in most public-key cryptography algorithms such as RSA,ElGamal, Fiat- Shamir.Based on analyzing existing algorithms, a improved Montgomery algorithm is firstly presented, and then, a new algorithm to fast implement modular exponentiation with very large operand is shown, which is based on sliding window technology and the improved Montgomery algorithm. It is shown by the theoretical analysis and experiment results that the implementation of public-key cryptosystem can be speeded up with this new algorithm.
出处
《杭州电子工业学院学报》
2003年第6期59-62,共4页
Journal of Hangzhou Institute of Electronic Engineering
基金
浙江省自然科学基金重点资助项目(ZD0101)
关键词
公钥密码体制
滑动窗口
大数模乘
模幂
Public-key Cryptosystem
Modular Exponentiation
Modular Multiplication
