RNS bases and conversions

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5559, Issue , 2004, Pages 60-69

  Bajard, Jean Claude ^a   Plantard, Thomas ^a  

^a LIRMM   (France)

Author keywords

Bases conversion; Division by a constant; Modular reduction; MRS; RNS

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER PROGRAMMING; FUNCTIONS; NUMBER THEORY; PARALLEL PROCESSING SYSTEMS; SET THEORY; VLSI CIRCUITS;

BASES CONVERSION; CHINESE REMAINDER THEORM; DIVISION BY A CONSTANT; MODULAR REDUCTION; RESIDUE NUMBER SYSTEM (RNS);

DIGITAL ARITHMETIC;

EID: 15844387125     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.557891     Document Type: Conference Paper

References (25)

1. D. Knuth, Seminumerical Algorithms, vol. 2 of The Art of Computer Programming, Addison-Wesley, 2 ed., 1981.
2. H. L. Garner, "The residue number system," IRE Transactions on Electronic Computers EL-8, pp. 140-147, June 1959.
3. M. H. Etzel and W. K. Jenkins, "The design of specialized residue classes for efficient recursive digital filter realization," IEEE Transactions on Acoustics, Speech and Signal Processing ASSP-30(3), pp. 370-380, 1982.
4. M. Soderstrand, W. Jenkins, G. Jullien, and F. Taylor, eds., Residue Number System Arithmetic: Modern Applications in Digital Signal Processing, (New-York), IEEE Press, 1986.
5. M. A. Bayoumi, G. A. Jullien, and W. C. Miller, "A look-up table VLSI design methodology for RNS structures used in DSP applications," IEEE Transactions on Circuits and Systems CAS-34(6), pp. 604-616, 1987.
6. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Transactions on Information Theory IT-22(6), pp. 644-54, 1976.
7. H. Brönnimann, I. Z. Emiris, V. Pan, and S. Pion, "Computing exact geometric predicates using modular arithmetic with single precision," in Proceedings of the 13th Annual Symposium on Computational Geometry, pp. 174-182, ACM, (Nice, France), 1997.
8. P. W. Beame, S. A. Cook, and H. J. Hoover, "Log depth circuits for division and related problems," in 25th Annual Symposium on fundations of Computer Science, pp. 1-6, IEEE Computer Society Press, 1984.
9. K. C. Posch and R. Posch, "Modulo reduction in residue number systems," IEEE Transaction on Parallel and Distributed Systems 6(5), pp. 449-454, 1995.
10. J.-C. Bajard, L.-S. Didier, and P. Kornerup, "An RNS montgomery modular multiplication algorithm," IEEE Transactions on Computers 47(7), pp. 766-776, 1998.
11. J.-C. Bajard and L. Imbert, "A full rns implementation of rsa," IEEE Transactions on Computers 53(6), pp. 769-774, 2004.
12. G. Alia and E. Martinelli, "On the lower bound to the VLSI complexity of number conversion from weighted to residue representation," IEEE Transactions on Computers 42(8), pp. 962-967, 1993.
13. B. Parhami, "Optimal table-lookup schemes for binary-to-residue and residue-to-binary conversions," in 27th Asilomar Conference on Signals, Systems and Computers, 1, pp. 812-816, IEEE Computer Society Press, (Pacific Grove, USA), 1993.
14. C. N. Zhang, B. Shirazi, and D. Y. Y. Yun, "An efficient algorithm and parallel implementations for binary and residue number systems," Journal of Symbolic Computation 15(4), pp. 451-462, 1993.
15. S. J. Piestrak, "Design of high-speed residue-to-binary number system converter based on Chinese remainder theorem," in ICCD 1994, PP. 508-511.
16. R. Conway and J. Nelson, "New crt-based rns converter using restricted moduli set," IEEE Transactions on Computers 52(5), pp. 572-578, 2003.
17. A. P. Shenoy and R. Kumaresan, "Fast base extension using a redundant modulus in RNS," IEEE Transactions on Computer 38(2), pp. 292-296, 1989.
18. C. Y. Hung and B. Parhami, "An approximate sign detection method for residue numbers and its application to RNS division," Computers and Mathematics with Applications 27, pp. 23-35, Feb. 1994.
19. J.-C. Bajard, L.-S. Didier, and J.-M. Muller, "A new euclidian division algorithm for residue number systems," Journal of VLSI Signal Processing, Image and Video Technology. A paraître.
20. N. S. Szabo and R. I. Tanaka, Residue Arithmetic and its Applications to Computer Technology, McGraw-Hill, 1967.
21. R. Conway and J. Nelson, "Fast converter for 3 moduli rns using new property of crt," IEEE Transactions on Computers 48(8), pp. 852-860, 1999.
22. J.-C. Bajard, L. Imbert, P. Liardet, and Y. Teglia, "Leak resistant arithmetic," in CHES 2004,
23. P. Montgomery, "Modular multiplication without trial division," Mathematic of Computation 44, pp. 519-521, Apr. 1985.
24. P. Barrett, "Implementing the rivest, shamir and adleman public key encryption algorithm on a standard digital processor," in Advances in Cryptology, Proceedings of Crypto'86, A. M. Odlyzko, ed., pp. 311-323, 1986.
25. A. Bosselaers, R. Govaerts, and J. Vandewalle, "Comparison of three modular reduction functions," in Advances in Cryptology, Proceedings Crypto'93, LNCS 773, D. Stinson, Ed., Springer-Verlag, 1994, PP. 175-186.