Citations (8)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (1)
Chia-Long Wu, Der-Chyuan Lou & Te-Jen Chang. (2010) Fast modular multiplication based on complement representation and canonical recoding. International Journal of Computer Mathematics 87:13, pages 2871-2879.
Read now
Read now
Articles from other publishers (7)
Chia Long Wu & Chen Hao Hu. (2014) Modular Arithmetic Analyses for RSA Cryptosystem. Modular Arithmetic Analyses for RSA Cryptosystem.
Chia-Long Wu & Chen-Hao Hu. (2012) Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application. Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application.
Chia-Long Wu. 2012. Intelligent Information and Database Systems. Intelligent Information and Database Systems
276
285
.
Chia-Long Wu, Der-Chyuan Lou & Te-Jen Chang. (2008) Fast Modular Multiplication for E-Commerce Cryptosystem. Fast Modular Multiplication for E-Commerce Cryptosystem.
Chia-Long Wu, Der-Chyuan Lou & Te-Jen Chang. (2007) Fast binary multiplication by performing dot counting and complement recoding. Applied Mathematics and Computation 191:1, pages 132-139.
Crossref
Crossref
Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai & Te-Jen Chang. (2007) Fast modular multi-exponentiation using modified complex arithmetic. Applied Mathematics and Computation 186:2, pages 1065-1074.
Crossref
Crossref
Der-Chyuan Lou, Jui-Chang Lai, Chia-Long Wu & Te-Jen Chang. (2007) An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques. Applied Mathematics and Computation 185:1, pages 31-44.
Crossref
Crossref