RNS montgomery multiplication algorithm for duplicate processing of base transformations

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 1, 2003, Pages 89-97

  Nozaki, Hanae ^a   Shimbo, Atsushi ^a   Kawamura, Shinichi ^a  

^a TOSHIBA CORPORATION   (Japan)

Author keywords

Base transformation; Modular exponentiation; Montgomery multiplication; Residue number systems; RSA cryptography

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; MATHEMATICAL TRANSFORMATIONS; PARALLEL PROCESSING SYSTEMS;

BASE TRANSFORMATIONS;

CRYPTOGRAPHY;

EID: 0041976947     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. P.L. Montgomery, "Modular multiplication without trial division," Math. Comput., vol.44, no.170, pp.519-521, 1985.
2. K. Iwamura, T. Matsumoto, and H. Imai, "Systolic-arrays for modular exponentiation using Montgomery method,'' Rump Session of EUROCRYPT 1992, LXCS, vol.1440, pp.477-481, Springer-Verlag, 1992.
3. K. Iwamura, T. Matsumoto, and H. Imai, "Montgomery's modular-multiplication method and systolic-arrays suitable for modular-exponentiation," IEICE Trans. Fundamentals (Japanese Edition), vol.J76-A, no.8, pp.1214-1223, Aug. 1993.
4. A. Satoh and K. Takano, "A fast Montgomery multiplier," Proc. Symposium on Cryptography and Information Security, Japan - SCIS 2001, pp.237-241, 2001.
5. C.D. Walter, "Systolic modular multiplication," IEEE Trans. Comput., vol.42, no.3, pp.376-378, 1993.
6. C.D. Walter, "Montgomery's multiplication technique: How to make it smaller and faster," Proc. CHES 1999, LNCS, vol.1717, pp.80-93, 1999.
7. C.D. Walter, ''An improved linear systolic array for fast modular exponentiation,'' IEE Computers and Digital Techniques, vol.147, no.5, pp.323-328, 2000.
8. A. Tiountchik and E. Trichina, "Modular exponentiation on fine-grained FPCA," Proc. CT-RSA 2001, LNCS, vol.2020, pp.223-234, 2001.
9. E. Trichina and A. Tiountchik, "Scalable algorithm for Montgomery multiplication and its implementation on the coarse-grain reconflgurable chip," Proc. CT-RSA 2001, LNCS, vol.2020, pp.235-249, 2001.
10. L. Batina and G. Muurling, "Montgomery in practice: How to do it more efficiently in hardware," Proc. CT-RSA 2002, LNCS, vol.2271, pp.40-52, 2002.
11. K.C. Posch and R. Posch, "Modulo reduction in residue number systems," IEEE Trans. Parallel Distributed Systems, vol.6, no.5, pp.449-454, 1995.
12. J.-C. Bajard, L.-S. Didier, and P. Kornerup, "An RNS Montgomery multiplication algorithm," Proc. ARITH 13, pp.234-239, IEEE Computer Society, 1997.
13. J.-C. Bajard, L.-S. Didier, and P. Kornerup, "An RNS Montgomery multiplication algorithm," IEEE Trans. Comput., vol.47, no.7, pp.766-776, 1998.
14. P. Paillier, "Low-cost double-size modular exponentiation or how to stretch your cryptoprocessor," Proc. PKC 1999, LNCS, vol.1560, pp.223-234, Springer-Verlag, 1999.
15. S. Kawamura, M. Koike, F. Sano, and A. Shimbo, "CoxRower architecture for fast Montgomery multiplication," Proc. EUROCRYPT 2000, LNCS, vol.1807, pp.523-538, Springer-Verlag, 2000.
16. H. Nozaki, A. Shimbo, and S. Kawamura, "RNS Montgomery multiplication based on duplicate processing of base transformations," Rump Session of EUROCRYPT 2001, 2001.
17. P. Barrett, "Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor," Proc. CRYPTO 1986, pp.311-323, 1987.
18. M. Koike, "Barrett reduction using residue number systems," Proc. Symposium on Cryptography and Information Security, Japan - SCIS 2002, pp.1095-1100, 2002.
19. H. Nozaki, M. Motoyama, A. Shimbo, and S. Kawamura, "Implementation of RSA algorithm based on RNS Montgomery multiplication," Proc. CHES 2001, LNCS, vol.2162, pp.364-376, Springer-Verlag, 2001.
20. E. Kranakis, Primality and cryptography, Wiley-Teubner Series in Computer Science, John Wiley & Sons, 1986.