共 23 条
[1]
Hariri A(2009)Bit-serial and bit-parallel Montgomery multiplication and squaring over GF IEEE Trans Comput 58 1332-1345
[2]
Reyhani-Masoleh A(2011)New hardware architectures for Montgomery modular multiplication algorithm IEEE Trans Comput 60 923-936
[3]
Huang M(2004)A one round protocol for tripartite Diffie-Hellman J Cryptol 17 263-276
[4]
Gaj K(1996)Analyzing and comparing Montgomery multiplication algorithms IEEE Micro 16 26-33
[5]
El-Ghazawi T(1987)Elliptic curve cryptosystems Math Comput 48 203-209
[6]
Joux A(2010)Montgomery and RNS for RSA hardware implementation Cpmput Inform 29 849-880
[7]
Koç CK(1982)Why systolic architectures? Computer 15 37-46
[8]
Acar T(1985)Modular multiplication without trial division Math Comput 44 519-521
[9]
Kaliski BSJr(2011)Montgomery modular multiplication on reconfigurable hardware: systolic versus multiplexed implementation Int J Reconfig Comput 2011 61-610
[10]
Koblitz N(1978)A method for obtaining digital signatures and public-key cryptosystems Commun ACM 21 120-126