[1]HARDY G H,WRIGHT E M.数论导引 [M].张晓明,张凡,译.北京:人民邮电出版社,2008.[2]CRANDALL R,POMERANCE C.Prime numbers:A computational perspective[M].Berlin:Springer-Verlag,2001.[3]颜松远.计算数论 [M].2版.杨思熳,刘巍,齐璐璐,等译.北京:清华大学出版社,2008.[4]裴定一,祝跃飞.算法数论 [M].北京:科学出版社,2002.[5]李继国,余纯武,张福泰,等.信息安全数学基础 [M].武汉:武汉大学出版社,2006.[6]朱怡健,朱敏,王健.计算机组成原理 [M].南京:东南大学出版社,1994.[7]MONTGOMERY P L.Modular multiplication without trial division [J].Mathematics of Computation,1985,44(170):519-521.[8]蒋晓娜,段成华.改进的蒙哥马利算法及其模乘法器实现[J].计算机工程,2008,34(12):209-211.[9]BLAKLEY G R.A computer algorithm for calculating the product AB modulo M [J].IEEE Transactions on Computers,1983,C-32(5):497-500.[10]CHEN CHIENYUAN,CHANG CHINCHEN.A fast modular multiplication algorithm for calculating the product AB modulo N [J].Information Processing Letters,1999,72(3/4):77-81.[11]KARL H.Fast division of large integers:a comparison of algorithms [EB/OL].[2011-03-23].http://www.treskal.com/kalle/exjobb/original-report.pdf.[12]徐国良.任意高精度四则运算的算法与实现 [J].数值计算与计算机应用,1983,4(4):229-240. |