Fast modular multiplication based on complement representation and canonical recoding

References

• Arno, S. , and Wheeler, F. S. , 1993. Signed digit representations of minimal Hamming weight , IEEE Trans. Comput. 42 (8) (1993), pp. 1007–1010.
   Web of Science ®Google Scholar
• Avizienis, A. , 1961. Signed-digit number representations for fast parallel arithmetic , IRE Trans. Electron. Comput. 10 (1961), pp. 389–400.
   Google Scholar
• Chang, C.-C. , and Lou, D.-C. , 1997. Parallel computation of multi-exponentiation for cryptosystems , Int. J. Comput. Math. 63 (1–2) (1997), pp. 9–26.
   Web of Science ®Google Scholar
• Chang, C.-C. , Kuo, Y.-T. , and Lin, C.-H. , 2003. Fast algorithms for common multiplicand multiplication and exponentiation by performing complements . Presented at Proceeding of 17th International Conference on Advanced Information Networking and Application, IEEE Computer Society.
   Google Scholar
• Diffie, W. , and Hellmen, E. , 1976. New directions in cryptography , IEEE Trans. Inf. Theory 22 (6) (1976), pp. 644–654.
   Web of Science ®Google Scholar
• ElGamal, T. , 1985. A public key cryptosystem and a signature scheme based on discrete logarithms , IEEE Trans. Inf. Theory 31 (4) (1985), pp. 469–472.
   Web of Science ®Google Scholar
• Ha, J. C. , and Moon, S. J. , 1998. A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation , Inf. Process. Lett. 66 (2) (1998), pp. 105–107.
   Web of Science ®Google Scholar
• Joye, M. , and Yen, S.-M. , 2000. Optimal left-to-right binary signed-digit recoding , IEEE Trans. Comput. 49 (7) (2000), pp. 740–748.
   Web of Science ®Google Scholar
• Knuth, D. E. , 1997. The Art of Computer Programming, Volume 2: Seminumerical Algorithms . MA: Addison-Wesley; 1997.
   Google Scholar
• Koc, C. K. , and Johnson, S. , 1994. Multiplication of signed-digit numbers , Electron. Lett. 30 (11) (1994), pp. 840–841.
   Web of Science ®Google Scholar
• Kooshesh, A. , and Ravikumar, B. , 2008. Efficient implementation of algorithms for approximate exponentiation , Inf. Process. Lett. 105 (4) (2008), pp. 131–137.
   Web of Science ®Google Scholar
• Lou, D.-C. , and Chang, C.-C. , 1996. Fast exponentiation method obtained by folding the exponent in half , Electron. Lett. 32 (11) (1996), pp. 984–985.
   Web of Science ®Google Scholar
• Lou, D.-C. , Wu, C.-L. , and Chen, C.-Y. , 2003. Fast exponentiation by folding the signed-digit exponent in half , Int. J. Comput. Math. 80 (10) (2003), pp. 1251–1259.
   Web of Science ®Google Scholar
• Montgomery, P. L. , 1985. Modular multiplication without trial division , Math. Comput. 44 (170) (1985), pp. 519–521.
   Web of Science ®Google Scholar
• Rivest, R. L. , Shamir, A. , and Adleman, L. , 1978. A method for obtaining digital signatures and public key cryptosystems , Commun. ACM 21 (2) (1978), pp. 120–126.
   Web of Science ®Google Scholar
• Stallings, W. , 2002. "Cryptography and Network Security Principles and Practice". NY: Prentice-Hall; 2002.
   Google Scholar
• Tenca, A. F. , and Koc, C. K. , 2003. A scalable architecture for modular multiplication based on Montgomery's algorithm , IEEE Trans. Comput. 52 (9) (2003), pp. 1215–1221.
   Web of Science ®Google Scholar
• Wright, S. , 2008. Quadratic residues and the combinatorics of sign multiplication , J. Number Theory 128 (4) (2008), pp. 918–925.
   Web of Science ®Google Scholar
• Wu, T.-C. , and Chang, Y.-S. , 1995. Improved generalization common -multiplicand-multiplications algorithm of Yen and Laih , Electron. Lett. 31 (20) (1995), pp. 1738–1739.
   Web of Science ®Google Scholar
• Wu, C.-L. , Lou, D.-C. , and Chang, T.-J. , 2007. Fast binary multiplication by performing dot counting and complement recoding , Appl. Math. Comput. 191 (1) (2007), pp. 132–139.
   Web of Science ®Google Scholar
• Yang, J.-H. , and Chang, C.-C. , 2008. Efficient residue number system iterative modular multiplication algorithm for fast modular exponentiation , IET Comput. Digit. Tech. 2 (1) (2008), pp. 1–5.
   Web of Science ®Google Scholar
• Yen, S.-M. , 1997. Improved common-multiplicand-multiplication and fast exponentiation by exponent decomposition , IEICE Trans. Fund. E80-A(6) (1997), pp. 1160–1163.
   Google Scholar
• Yen, S.-M. , and Laih, C.-S. , 1993. Common-multiplicand-multiplication and its applications to public key cryptography , Electron. Lett. 29 (17) (1993), pp. 1583–1584.
   Web of Science ®Google Scholar