参考文献
[1] Kwon T W, You C S, Heo W S, et al. Two Implementation Methods of a 1 024-bit RSA Cryptoprocessor Based on Modi- fied Montgomery Algorithm[C]//Proc. of ISCAS’01. Sydney, Australia: IEEE Press, 2001.
[2] Shieh Ming-Der, Chen Jun-Hong, Wu Hao-Hsuan, et al. A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem[J]. IEEE Transactions on Very Large Scale Integration(VLSI) Systems, 2008, 16(9): 1151- 1161.
[3] Shieh Ming-Der, Chen Jun-Hong, Wu Hao-Hsuan, et al. A New Algorithm for High-speed Modular Multiplication Design[J]. IEEE Transactions on Circuits and Systems, 2009, 56(9): 2009-2019.
[4] 薛 念, 潘 赟, 张宇弘, 等. 基于Montgomery模乘的RSA 加密处理器[J]. 计算机工程, 2010, 36(13): 125-127.
[5] Walter C D. Systolic Modular Multiplication[J]. IEEE
Transactions on Computers, 1993, 42(3): 376-378.
[6] 王 旭, 董 威, 戎蒙恬. 基于改进Montgomery模乘算法的RSA加密处理器的实现[J]. 上海交通大学学报, 2004, 38(2): 240-244.
[7] 张远洋, 李 峥, 杨 磊, 等. 一种新型的基于Montgomery的模幂器结构[J]. 计算机工程, 2007, 33(16): 211-213.
[8] Mcivor C, Mcloone M, Mccanny J V. Modified Montgomery Modular Multiplication and RSA Exponentiation Techni- ques[J]. IEE Proceedings-Computers and Digital Techniques, 2004, 151(6): 402-408.
[9] Hu Zhengbing, Shboulr R M, Shirochin V P. An Efficient Architecture of 1 024-bits Cryptoprocessor for RSA Crypto- system Based on Modified Montgomery’s Algorithm[C]//Proc. of IDAACS’07. Dortmund, Germany: [s. n.], 2007.
[10] Stallings W. 密码编码学与网络安全——原理与实践[M]. 3版. 刘玉珍, 译. 北京: 电子工业出版社, 2004.
编辑 金胡考 |