{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:56:23Z","timestamp":1755222983580,"version":"3.43.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1023\/a:1008065819322","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T07:45:23Z","timestamp":1040543123000},"page":"167-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A New Euclidean Division Algorithm for Residue Number Systems"],"prefix":"10.1007","volume":"19","author":[{"given":"Jean-Claude","family":"Bajard","sequence":"first","affiliation":[]},{"given":"Laurent-St\u00e9phane","family":"Didier","sequence":"additional","affiliation":[]},{"given":"Jean-Michel","family":"Muller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,7,1]]},"reference":[{"key":"167703_CR1","doi-asserted-by":"crossref","unstructured":"D. Naccache, D. M'rairhi, W. Wolfowicz, and A. di Porto, \u201cAre crypto-acceleratos really inevitable?\u201d Advances in Cryptology, Eurocrypt'95, pp. 404-409, 1995.","DOI":"10.1007\/3-540-49264-X_33"},{"key":"167703_CR2","doi-asserted-by":"crossref","unstructured":"H. Br\u00f6nniman, I.Z. Emeris, V. Pan, and S. Pion, \u201cComputing exact geometric predicates using modular arithmetic with single precision,\u201d Proc. of ACM Symposium on Computational Geometry, Nice, 1997.","DOI":"10.1145\/262839.262948"},{"key":"167703_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-9260(91)90007-8","volume":"11","author":"F. Barsi","year":"1991","unstructured":"F. Barsi and E. Martinelli, \u201cA VLSI architecture for RNS with mi adders,\u201d Integration, The VLSI Journal, Vol. 11, pp. 67-83, 1991.","journal-title":"Integration, The VLSI Journal"},{"key":"167703_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0020-0190(91)90198-Q","volume":"40","author":"F. Barsi","year":"1991","unstructured":"F. Barsi, \u201cMod m arithmetic in binary systems,\u201d Information Processing Letters, Vol. 40, pp. 303-309, 1991.","journal-title":"Information Processing Letters"},{"key":"167703_CR5","unstructured":"D. Knuth, The Art of Computer Programming, Addison Wesley, Vol. 2, 1973."},{"key":"167703_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TEC.1959.5219515","volume":"EC-8","author":"H.L. Garner","year":"1959","unstructured":"H.L. Garner, \u201cThe residue number system,\u201d IRE Trans. Electro. Comput., Vol. EC-8, pp. 140-147, 1959.","journal-title":"IRE Trans. Electro. Comput."},{"key":"167703_CR7","unstructured":"N.S. Szabo and R.I. Tanaka, Residue Arithmetic and its Applications to Computer Technology, McGraw-Hill, 1967."},{"key":"167703_CR8","doi-asserted-by":"crossref","unstructured":"F.J. Taylor, \u201cA more efficient residue arithmetic implementation of the FFT,\u201d Proc. of 5th Symposium on Computer Arithmetic, IEEE Computer Society Press, 1985.","DOI":"10.1109\/ARITH.1985.6158977"},{"issue":"5","key":"167703_CR9","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/12.223680","volume":"42","author":"G. Dimauro","year":"1993","unstructured":"G. Dimauro, S. Impedovo, and G. Pirlo, \u201cA new technique for fast number comparison in the residue number system,\u201d IEEE Trans. Comput., Vol. 42, No.5, pp. 608-612, 1993.","journal-title":"IEEE Trans. Comput."},{"key":"167703_CR10","doi-asserted-by":"crossref","unstructured":"S. Kaushik, \u201cSign detection in non-redundant residue number system with reduced information,\u201d Proc. of 6th Symposium on Computer Architecture, IEEE Computer Society Press, 1983.","DOI":"10.1109\/ARITH.1983.6158084"},{"key":"167703_CR11","doi-asserted-by":"crossref","unstructured":"D. Gamberger, \u201cNew approach to integer division in residue number system,\u201d in Proc. of the 10th Symposium on Computer Arithmetic, P. Kornerup and D. Matula (Eds.), IEEE Computer Society Press, pp. 84-91, 1991.","DOI":"10.1109\/ARITH.1991.145538"},{"key":"167703_CR12","doi-asserted-by":"crossref","unstructured":"D. Gamberger, \u201cIncomplete specified numbers in residue number system\u2013Defintion and applications,\u201d in Proc. of the 9th Symposium on Computer Arithmetic, M.D. Ercegovac and E. Swartzlander (Eds.), IEEE Computer Society Press, pp. 210- 215, 1989.","DOI":"10.1109\/ARITH.1989.72828"},{"key":"167703_CR13","doi-asserted-by":"crossref","unstructured":"J.S. Chiang and M. Lu, \u201cA general division algorithm for residue number systems,\u201d in Proc. of the 10th IEEE Symposium on Computer Arithmetic, P. Kornerup and D. Matula (Eds.), IEEE Computer Society Press, pp. 76-83, 1991.","DOI":"10.1109\/ARITH.1991.145537"},{"issue":"8","key":"167703_CR14","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/12.156545","volume":"41","author":"M. Lu","year":"1992","unstructured":"M. Lu and J.S. Chiang, \u201cA novel division algorithm for the residue number system,\u201d IEEE Trans. Comput., Vol. 41, No.8, pp. 1026-1032, 1992.","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"167703_CR15","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.403714","volume":"44","author":"M.A. Hitz","year":"1995","unstructured":"M.A. Hitz and E. Kaltofen, \u201cInteger division in residue number systems,\u201d IEEE Trans. Comput., Vol. 44, No.8, p. 993, 1995.","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"167703_CR16","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/12.83626","volume":"40","author":"G. Alia","year":"1991","unstructured":"G. Alia and E. Martinelli, \u201cA VLSI modulo m multiplier,\u201d IEEE Trans. Comput., Vol. 40, No.7, pp. 873-878, 1991.","journal-title":"IEEE Trans. Comput."},{"key":"167703_CR17","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1109\/ARITH.1993.378083","volume-title":"Proc. of 11th Symposium on Computer Artithmetic","author":"N. Takagi","year":"1993","unstructured":"N. Takagi, \u201cA modular multiplication algorithm with triangle additions,\u201d 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."},{"key":"167703_CR18","doi-asserted-by":"crossref","unstructured":"N. Takagi, \u201cA radix-4 modular multiplication hardware algorithm efficient for iterative modular multiplications,\u201d in Proc. of the 10th Symposium on Computer Arithmetic, P. Kornerup and D. Matula (Eds.), IEEE Computer Society Press, pp. 35-41, 1991.","DOI":"10.1109\/ARITH.1991.145531"},{"key":"167703_CR19","doi-asserted-by":"crossref","unstructured":"P. Kornerup, \u201cHigh-radix modular multiplication for cryptosystems,\u201d 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.","DOI":"10.1109\/ARITH.1993.378082"}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008065819322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008065819322\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008065819322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T09:51:09Z","timestamp":1754905869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008065819322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["167703"],"URL":"https:\/\/doi.org\/10.1023\/a:1008065819322","relation":{},"ISSN":["0922-5773"],"issn-type":[{"type":"print","value":"0922-5773"}],"subject":[],"published":{"date-parts":[[1998,7]]},"assertion":[{"value":"1 July 1998","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}