The following publications are possibly variants of this publication:
- An Efficient Montgomery Exponentiation Algorithm for Cryptographic ApplicationsChia-Long Wu, Der-Chyuan Lou, Te-Jen Chang. informaticaLT, 16(3):449-468, 2005. [doi]
- An improved Montgomery s algorithm for high-speed RSA public-key cryptosystemChih-Yuang Su, Shih-Am Hwang, Po-Song Chen, Cheng-Wen Wu. tvlsi, 7(2):280-284, 1999. [doi]
- Fast Parallel Exponentiation Algorithm for RSA Public-Key CryptosystemChia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Jen Chang. informaticaLT, 17(3):445-462, 2006. [doi]
- Radix-4 modular multiplication and exponentiation algorithms for the RSA public-key cryptosystemJin-Hua Hong, Cheng-Wen Wu. aspdac 2000: 565-570 [doi]
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiationChia-Long Wu. isci, 179(4):410-421, 2009. [doi]
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniquesDer-Chyuan Lou, Jui-Chang Lai, Chia-Long Wu, Te-Jen Chang. amc, 185(1):31-44, 2007. [doi]
- Batch Public Key Cryptosystem with batch multi-exponentiationQianhong Wu, Yang Sun, Bo Qin, Jiankun Hu, Weiran Liu, Jianwei Liu, Yong Ding. fgcs, 62:196-204, 2016. [doi]