]. P. Bar86 and . Barrett, Implementing the rivest, shamir and adleman public key encryption algorithm on a standard digital processor, Advances in Cryptology, Proceedings of Crypto'86, pp.311-323, 1986.

J. Bajard, L. Didier, and P. Kornerup, An RNS Montgomery modular multiplication algorithm, IEEE Transactions on Computers, vol.47, issue.7, pp.766-776, 1998.
DOI : 10.1109/12.709376

J. Bajard, L. Didier, and P. Kornerup, Modular multiplication and base extensions in residue number systems, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.59-65, 2001.
DOI : 10.1109/ARITH.2001.930104

J. Bajard, L. Imbert, J. Bajard, L. Imbert, P. L. Liardet et al., a full RNS implementation of RSA, CHES 2004 Bajard and T. Plantard. Rns bases and conversions SPIE Annual Meeting Advenced Signal Processing Algorithms, Architectures, and Implementation XIV, pp.769-774, 2004.
DOI : 10.1109/TC.2004.2
URL : https://hal.archives-ouvertes.fr/lirmm-00108553

R. Conway and J. Nelson, Fast converter for 3 moduli RNS using new property of CRT, IEEE Transactions on Computers, vol.48, issue.8, pp.852-860, 1999.
DOI : 10.1109/12.795127

D. Gamberger, Incompletely specified numbers in the residue number system-definition and applications, Proceedings of 9th Symposium on Computer Arithmetic, pp.210-215, 1989.
DOI : 10.1109/ARITH.1989.72828

]. H. Gar59 and . Garner, The residue number system, IRE Transactions on Electronic Computers, issue.86, pp.140-147, 1959.

C. Y. Hung and B. Parhami, An approximate sign detection method for residue numbers and its application to RNS division, Computers & Mathematics with Applications, vol.27, issue.4, pp.23-35, 1994.
DOI : 10.1016/0898-1221(94)90052-3

D. Knuth, Seminumerical Algorithms, volume 2 of The Art of Computer Programming, 1981.

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

J. Stanislaw, . C. Piestrakpp95-]-k, R. Posch, and . Posch, Design of high-speed residue-tobinary number system converter based on chinese remainder theorem Modulo reduction in residue number systems, ICCD 1994, pp.508-511449, 1994.

A. P. Shenoy, R. Kumaresan, R. I. Szabo, and . Tanaka, Fast base extension using a redundant modulus in RNS, IEEE Transactions on Computers, vol.38, issue.2, pp.292-296, 1967.
DOI : 10.1109/12.16508