期刊文献+

Montgomery算法的研究与实现

Study and Realization of Montgomery Algorithm
下载PDF
导出
摘要 分析了 Montgom ery算法 ,指出用改进的预计算 Montgom ery算法实现模幂运算的过程 ,分析并比较了两种实现模乘和模幂乘算法。并分别用 C+ + 和 Modelsim进行仿真 。 Montgomery algorithm is core section in RSA cryptosystem In this paper,introduced two modified Montgomery algorithm In the two algorithms,the RL modular exponentiation is adapted to hardware implementation by using parallel computation The two algorithms was simulated by C ++ and modelsim, and proved speed improvement of hardware encrypt and decrypt using the RL method
作者 张宪 王喜成
出处 《现代电子技术》 2004年第8期85-86,共2页 Modern Electronics Technique
基金 广西壮族自治区自然科学基金
关键词 MONTGOMERY算法 模幂乘运算 模乘 RSA Montgomery algorithm modular exponentiation modular multiply RSA
  • 相关文献

参考文献1

二级参考文献4

  • 1[1]Blakley G R. A computer algorithm for the product AB modulo M[J]. IEEE Transactions on Computers, 1983,32(5):497-500. 被引量:1
  • 2[2]Acar T. Montgomery multiplication in GF(2k)[C]. In Third Annual Workshop on Selected Areas in Cryptography, pages 95-106, Queen's University,Kingston, Canada, 15-16 August 1996. IACR. 被引量:1
  • 3[3]Acar T and Kaliski B Jr. Analyzing and comparing Montgomery multiplication algorithms[J]. IEEE Micro, 1996,16(3):26-33. 被引量:1
  • 4[4]Itoh T, Teachai O,Tsujii S. A fast algorithm for computing multiplicative in-verses in GF(2t) using normal bases[J]. J.Soc.Electron.Communications (Japan), 1986,44:31-36. 被引量:1

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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