Fast, compact and symmetric modular exponentiation architecture by common-multiplicand Montgomery modular multiplications

Rivest, 1978, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21, 120, 10.1145/359340.359342 ElGamal, 1985, A public-key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, 31, 469, 10.1109/TIT.1985.1057074 Diffie, 1976, New directions in cryptography, IEEE Transactions on Information Theory, 22, 644, 10.1109/TIT.1976.1055638 Blum, 2001, High-radix Montgomery modular exponentiation on reconfigurable hardware, IEEE Transactions on Computers, 50, 759, 10.1109/12.936241 H. Nozaki, M. Motoyama, A. Shimbo, S. Kawamura, Implementation of RSA algorithm based on RNS Montgomery modular multiplication, in: Third International Workshop on Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science, vol. 2162, Springer, Berlin, 2001, pp. 364–376. N. Jiang, D. Harris, Quotient pipelined very high radix scalable Montgomery multipliers, in: Fortieth Asilomar Conference on Signals, Systems and Computers, 2006, pp. 1673–1677. Shieh, 2009, A new algorithm for high-speed modular multiplication design, IEEE Transactions on Circuits and Systems-I, 56, 2009, 10.1109/TCSI.2008.2011585 Cohen, 2011, Architecture optimizations for the RSA public key cryptosystem, IEEE Circuits and Systems Magazine, 24, 10.1109/MCAS.2011.942747 Huang, 2011, New hardware architectures for Montgomery modular multiplication algorithm, IEEE Transactions on Computers, 60, 923, 10.1109/TC.2010.247 T. Wu, S. Li, L. Liu, CSA-based design of feedforward scalable Montgomery modular multiplier, in: IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), 2011, pp. 54–59. Ha, 1998, A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation, Information Processing Letters, 66, 105, 10.1016/S0020-0190(98)00031-3 C. Wu, D. Lou, T. Chang, An efficient Montgomery exponentiation algorithm for public-key cryptosystems, in: IEEE International Conference on Intelligence and Security Informatics, 2008, pp. 284–285. A.P. Fournaris, Fault and simple power attack resistant RSA using Montgomery modular multiplication, in: IEEE International Symposium on Circuits and Systems, 2010, pp. 1875–1878. Tenca, 2003, A scalable architecture for modular multiplication based on Montgomery's algorithm, IEEE Transactions on Computers, 52, 1215, 10.1109/TC.2003.1228516 Wu, 2009, An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation, Information Sciences, 179, 410, 10.1016/j.ins.2008.10.004 A. Rezai, P. Keshavarzi, High-performance modular exponentiation algorithm by using a new modified modular multiplication algorithm and common-multiplicand-multiplication method, in: World Congress on Internet Security, 2011, pp. 192–197. H.S. Kim, K.Y. Yoo, Area efficient exponentiation using modular multiplier/squarer in GF(2m), in: Computing and Combinatorics, Lecture Notes in Computer Science, vol. 2108, Springer, Berlin, 2001, pp. 262–267. H. Orup, Simplifying quotient determination in high-radix modular multiplication, in: 12th IEEE Symposium on Computer Arithmetic, Bath, England, UK, 1995, pp. 193–199. Walter, 1999, Montgomery exponentiation needs no final subtractions, Electronics Letters, 35, 1831, 10.1049/el:19991230 M. Joye, S. Yen, The Montgomery powering ladder, in: International Workshop on Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science, vol. 2523, Springer-Verlag, 2002, pp. 291–302. T. Wu, S. Li, L. Liu, A two-stage pipelined architecture for parallel modular exponentiation, in: IEEE International Conference on Information Science and Technology, 2012, pp. 215–218. A. Tenca, Ç. Koç, Scalable architecture for Montgomery multiplication, in: First International Workshop on Cryptographic Hardware and Embedded Systems, Worcester, USA, 1999, pp. 94–108. Sutter, 2011, Modular multiplication and exponentiation architectures for fast RSA cryptosystem based on digit serial computation, IEEE Transactions on Industrial Electronics, 58, 3101, 10.1109/TIE.2010.2080653 Miyamoto, 2011, Systematic design of RSA processors based on high-radix Montgomery multipliers, IEEE Transactions on Very Large Scale Integration (VLSI) SYSTEMS, 19, 1136, 10.1109/TVLSI.2010.2049037 McIvor, 2004, Modified Montgomery modular multiplication and RSA exponentiation techniques, IEE Proceedings on Computers and Digital Techniques, 151, 402, 10.1049/ip-cdt:20040791