Skip to main content
SpringerLink
Log in

A New Euclidean Division Algorithm for Residue Number Systems

  • Published:
Journal of VLSI signal processing systems for signal, image and video technology Aims and scope Submit manuscript

Abstract

We propose a new algorithm and architecture for performing divisions in residue number systems (RNS). Our algorithm is suitable for RNS with large moduli, with the aim of manipulating very large integers on a parallel computer or a special-purpose architecture. The two basic features of our algorithm are the use of a high-radix division method, and the use of a floating-point arithmetic that should run in parallel with the modular arithmetic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Naccache, D. M'rairhi, W. Wolfowicz, and A. di Porto, “Are crypto-acceleratos really inevitable?” Advances in Cryptology, Eurocrypt'95, pp. 404-409, 1995.

  2. H. Brönniman, I.Z. Emeris, V. Pan, and S. Pion, “Computing exact geometric predicates using modular arithmetic with single precision,” Proc. of ACM Symposium on Computational Geometry, Nice, 1997.

  3. F. Barsi and E. Martinelli, “A VLSI architecture for RNS with mi adders,” Integration, The VLSI Journal, Vol. 11, pp. 67-83, 1991.

    Article  Google Scholar 

  4. F. Barsi, “Mod m arithmetic in binary systems,” Information Processing Letters, Vol. 40, pp. 303-309, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  5. D. Knuth, The Art of Computer Programming, Addison Wesley, Vol. 2, 1973.

  6. H.L. Garner, “The residue number system,” IRE Trans. Electro. Comput., Vol. EC-8, pp. 140-147, 1959.

    Article  Google Scholar 

  7. N.S. Szabo and R.I. Tanaka, Residue Arithmetic and its Applications to Computer Technology, McGraw-Hill, 1967.

  8. F.J. Taylor, “A more efficient residue arithmetic implementation of the FFT,” Proc. of 5th Symposium on Computer Arithmetic, IEEE Computer Society Press, 1985.

  9. G. Dimauro, S. Impedovo, and G. Pirlo, “A new technique for fast number comparison in the residue number system,” IEEE Trans. Comput., Vol. 42, No.5, pp. 608-612, 1993.

    Article  MathSciNet  Google Scholar 

  10. S. Kaushik, “Sign detection in non-redundant residue number system with reduced information,” Proc. of 6th Symposium on Computer Architecture, IEEE Computer Society Press, 1983.

  11. D. Gamberger, “New approach to integer division in residue number system,” in Proc. of the 10th Symposium on Computer Arithmetic, P. Kornerup and D. Matula (Eds.), IEEE Computer Society Press, pp. 84-91, 1991.

  12. D. Gamberger, “Incomplete specified numbers in residue number system–Defintion and applications,” in Proc. of the 9th Symposium on Computer Arithmetic, M.D. Ercegovac and E. Swartzlander (Eds.), IEEE Computer Society Press, pp. 210- 215, 1989.

  13. J.S. Chiang and M. Lu, “A general division algorithm for residue number systems,” in Proc. of the 10th IEEE Symposium on Computer Arithmetic, P. Kornerup and D. Matula (Eds.), IEEE Computer Society Press, pp. 76-83, 1991.

  14. M. Lu and J.S. Chiang, “A novel division algorithm for the residue number system,” IEEE Trans. Comput., Vol. 41, No.8, pp. 1026-1032, 1992.

    Article  MathSciNet  Google Scholar 

  15. M.A. Hitz and E. Kaltofen, “Integer division in residue number systems,” IEEE Trans. Comput., Vol. 44, No.8, p. 993, 1995.

    Article  MathSciNet  Google Scholar 

  16. G. Alia and E. Martinelli, “A VLSI modulo m multiplier,” IEEE Trans. Comput., Vol. 40, No.7, pp. 873-878, 1991.

    Article  Google Scholar 

  17. N. Takagi, “A modular multiplication algorithm with triangle additions,” in Proc. of 11th Symposium on Computer Artithmetic, M.J. Irwin, E.E. Swartzlander, and G. Jullien (Eds.), IEEE Computer Society Press, Los Alamitos, CA, pp. 272-276, 1993.

    Chapter  Google Scholar 

  18. N. Takagi, “A radix-4 modular multiplication hardware algorithm efficient for iterative modular multiplications,” in Proc. of the 10th Symposium on Computer Arithmetic, P. Kornerup and D. Matula (Eds.), IEEE Computer Society Press, pp. 35-41, 1991.

  19. P. Kornerup, “High-radix modular multiplication for cryptosystems,” in Proc. of 11th IEEE Symposium on Computer Arithmetic, G. Jullien, M.J. Irwin, and E. Swartzlander (Eds.), IEEE Computer Society Press, pp. 277-283, 1993.

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique de Marseille, CML, Université de Provence, 39 rue Joliot-Curie, 13453, Marseille Cedex, France

    Jean-Claude Bajard & Laurent-Stéphane Didier

  2. CNRS, Laboratoire de l'Informatique du Parallélisme, 46 Allée d'Italie, 69364, Lyon Cedex 07, France

    Jean-Michel Muller

Authors
  1. Jean-Claude Bajard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent-Stéphane Didier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Michel Muller
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bajard, JC., Didier, LS. & Muller, JM. A New Euclidean Division Algorithm for Residue Number Systems. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 19, 167–178 (1998). https://doi.org/10.1023/A:1008065819322

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008065819322

Keywords

Search

Navigation