{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:47:02Z","timestamp":1726519622772},"reference-count":13,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Electrical Engineering"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0045-7906(03)00013-2","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"801-811","source":"Crossref","is-referenced-by-count":11,"title":["Parallel computational algorithms for generalized Chinese remainder theorem"],"prefix":"10.1016","volume":"29","author":[{"given":"Yeu-Pong","family":"Lai","sequence":"first","affiliation":[]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0045-7906(03)00013-2_BIB1","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1109\/TCS.1978.1084399","article-title":"On decoding techniques for residue number system realizations of digital signal processing hardware","volume":"25","author":"Baraniecka","year":"1978","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"10","key":"10.1016\/S0045-7906(03)00013-2_BIB2","doi-asserted-by":"crossref","first-page":"2427","DOI":"10.1109\/78.469842","article-title":"Fast base extension and precise scaling in RNS for look-up table implementations","volume":"43","author":"Barsi","year":"1995","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0045-7906(03)00013-2_BIB3","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1109\/TC.1986.1676829","article-title":"An implementation of mixed-radix conversion for residue number applications","volume":"35","author":"Chakraborti","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0045-7906(03)00013-2_BIB4","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1109\/49.223873","article-title":"A new generalized group-oriented cryptoscheme without trusted centers","volume":"11","author":"Chang","year":"1993","journal-title":"IEEE J. Selected Areas Commun."},{"issue":"4","key":"10.1016\/S0045-7906(03)00013-2_BIB5","first-page":"233","article-title":"A cryptosystem for secure broadcasting","volume":"12","author":"Chang","year":"1988","journal-title":"Proc. National Sci. Council"},{"year":"1969","series-title":"The art of computer programming. Vol. II: seminumerical algorithms","author":"Knuth","key":"10.1016\/S0045-7906(03)00013-2_BIB6"},{"key":"10.1016\/S0045-7906(03)00013-2_BIB7","unstructured":"McGovern W. Rings of quotients of f-rings by Gabriel filters of ideals. Ph.D. Dissertation, Department of Mathematics, University of Folorida, 1997"},{"key":"10.1016\/S0045-7906(03)00013-2_BIB8","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/82.160172","article-title":"An RNS to binary converter in 2n+1,2n,2n\u22121 moduli set","volume":"39","author":"Premkumar","year":"1992","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/S0045-7906(03)00013-2_BIB9","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1109\/31.7577","article-title":"Residue to binary conversion for RNS arithmetic using only modular look-up table","volume":"35","author":"Shenoy","year":"1988","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"5","key":"10.1016\/S0045-7906(03)00013-2_BIB10","doi-asserted-by":"crossref","first-page":"1346","DOI":"10.1109\/TASSP.1986.1164938","article-title":"On residue number system decoding","volume":"34","author":"Thun","year":"1986","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"2","key":"10.1016\/S0045-7906(03)00013-2_BIB11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/78.655432","article-title":"Highly parallel, fast scaling of numbers in nonredundant residue arithmetic","volume":"46","author":"Ulman","year":"1998","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0045-7906(03)00013-2_BIB12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/82.826745","article-title":"Residue-to-binary converters based on net Chinese remainder theorems","volume":"47","author":"Wang","year":"2000","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"10.1016\/S0045-7906(03)00013-2_BIB13","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1109\/81.883343","article-title":"An improved residue-to-binary converter","volume":"47","author":"Wang","year":"2000","journal-title":"IEEE Trans. Circuits Syst."}],"container-title":["Computers & Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790603000132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790603000132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:51:24Z","timestamp":1553154684000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790603000132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":13,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0045790603000132"],"URL":"https:\/\/doi.org\/10.1016\/s0045-7906(03)00013-2","relation":{},"ISSN":["0045-7906"],"issn-type":[{"type":"print","value":"0045-7906"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}