P. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

G. R. Blakley, A Computer Algorithm for Calculating the Product AB Modulo M, IEEE Transactions on Computers, vol.32, issue.5, pp.497-500, 1983.
DOI : 10.1109/TC.1983.1676262

C. K. Koç and C. Y. Hung, Carry-save adders for computing the product AB modulo N, Electronics Letters, vol.26, issue.13, pp.899-900, 1990.
DOI : 10.1049/el:19900587

C. K. Koç and C. Y. Hung, Fast algorithm for modular reduction, Proc.: Computers and Digital Techniques, pp.265-271, 1998.
DOI : 10.1049/ip-cdt:19982091

N. Takagi and S. Yajima, Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem, IEEE Transactions on Computers, vol.41, issue.7, pp.887-891, 1992.
DOI : 10.1109/12.256444

N. Takagi, A radix-4 modular multiplication hardware algorithm for modular exponentiation, IEEE Transactions on Computers, vol.41, issue.8, pp.949-956, 1992.
DOI : 10.1109/12.156537

Y. Jeong and W. P. Burleson, VLSI array algorithms and architectures for RSA modular multiplication, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.5, issue.2, pp.211-217, 1997.
DOI : 10.1109/92.585224

S. Kim and G. E. Sobelman, Digit-serial modular multiplication using skew-tolerant domino CMOS, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), pp.1173-1176, 2001.
DOI : 10.1109/ICASSP.2001.941132
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.4533

E. Peeters, M. Neve, and M. Ciet, XTR Implementation on Reconfigurable Hardware, Proc. Workshop Cryptographic Hardware and Embedded Systems, pp.386-399, 2004.
DOI : 10.1007/978-3-540-28632-5_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.4677

J. Beuchat and J. Muller, Modulo M multiplication-addition: algorithms and FPGA implementation, Electronics Letters, vol.40, issue.11, pp.654-655, 2004.
DOI : 10.1049/el:20040463

R. Beguenane, J. Beuchat, J. Muller, and S. Simard, Modular Multiplication of Large Integers on FPGA, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005., 2005.
DOI : 10.1109/ACSSC.2005.1599986

D. N. Amanor, C. Paar, J. Pelzl, V. Bunimov, and M. Schimmler, Efficient hardware architectures for modular multiplication on FPGAs, International Conference on Field Programmable Logic and Applications, 2005., pp.539-542, 2005.
DOI : 10.1109/FPL.2005.1515780

. Jean-luc, Beuchat received the MSc and PhD degrees in computer science from the Swiss Federal Institute of Technology, respectively. He is an associate professor in the Graduate School of Systems and Information Engineering, Laboratory of Cryptography and Information Security His current research interests include computer arithmetic and cryptography, 1997.

. Jean-michel, He is the directeur de recherches (senior researcher) at CNRS, France, and he is the former head of the LIP Laboratory (LIP is a joint laboratory of CNRS, the Ecole Normale Supé rieure de Lyon, INRIA, and the Université Claude Bernard Lyon 1) His research interests are in computer arithmetic. He is the author of several books, including Elementary Functions, Algorithms and Implementation He served as an associate editor of the IEEE Transactions on Computers from He is a senior, Muller received the PhD degree from the Institut National Polytechnique de Grenoble He was the co-program chair of the 13th IEEE Symposium on Computer Arithmetic in 1997 and the general chair of the 14th IEEE Symposium on Computer Arithmetic, 1985.