{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T05:27:04Z","timestamp":1706765224600},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1587\/transfun.2020cip0020","type":"journal-article","created":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T22:15:01Z","timestamp":1609452901000},"page":"121-134","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Sign Detection in RNS Using Approximate Reciprocals"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Shinichi","family":"KAWAMURA","sequence":"first","affiliation":[{"name":"ECSEC Technical Research Association"},{"name":"Toshiba Corporation"},{"name":"National Institute of Advanced Industrial Science and Technology"}]},{"given":"Yuichi","family":"KOMANO","sequence":"additional","affiliation":[{"name":"Toshiba Corporation"}]},{"given":"Hideo","family":"SHIMIZU","sequence":"additional","affiliation":[{"name":"Toshiba Corporation"}]},{"given":"Saki","family":"OSUKA","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology"}]},{"given":"Daisuke","family":"FUJIMOTO","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology"}]},{"given":"Yuichi","family":"HAYASHI","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology"},{"name":"Nara Institute of Science and Technology"}]},{"given":"Kentaro","family":"IMAFUKU","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] L. Sousa, S. Antao, and P. Martins, \u201cCombining residue arithmetic to design efficient cryptographic circuits and systems,\u201d IEEE Circuit Syst. Mag., vol.16, no.4, pp.6-32, 2016. 10.1109\/mcas.2016.2614714","DOI":"10.1109\/MCAS.2016.2614714"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] J.-C. Bajard, J. Eynard, and N. Merkiche, \u201cMontgomery reduction within the context of residue number system arithmetic,\u201d J. Cryptogr. Eng., vol.8, no.3, pp.189-200, Springer, 2018. 10.1007\/s13389-017-0154-9","DOI":"10.1007\/s13389-017-0154-9"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Kawamura, M. Koike, F. Sano, and A. Shimbo, \u201cCox-rower architecture for fast parallel Montgomery multiplication,\u201d EUROCRYPT2000, LNCS1807, pp.523-538, Springer, 2000. 10.1007\/3-540-45539-6_37","DOI":"10.1007\/3-540-45539-6_37"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] K. Bigou and A. Tisserand, \u201cImproving modular inversion in RNS using the plus-minus methods,\u201d CHES2013, LNCS8086, pp.223-249, Springer, 2013. 10.1007\/978-3-642-40349-1_14","DOI":"10.1007\/978-3-642-40349-1_14"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] K. Bigou and A. Tisserand, \u201cBinary-ternary plus-minus modular inversion in RNS,\u201d IEEE Trans. Comput., vol.65, no.11, pp.3495-3501, Nov. 2016. 10.1109\/tc.2016.2529625","DOI":"10.1109\/TC.2016.2529625"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] H.L. Garner, \u201cThe residue number system,\u201d IRE Trans. Electron. Comput., vol.EC-8, no.2, pp.140-147, 1959. 10.1109\/tec.1959.5219515","DOI":"10.1109\/TEC.1959.5219515"},{"key":"7","unstructured":"[7] D.E. Knuth, The Art of Computer Programing, vol.2, 3rd ed., Addison-Wesley, 1997."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T.V. Vu, \u201cEfficient implementations of the Chinese remainder theorem for sign detection and residue decoding,\u201d IEEE Trans. Comput., vol.C-34, no.7, pp.646-651, July 1985. 10.1109\/tc.1985.1676602","DOI":"10.1109\/TC.1985.1676602"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] D.S. Phatak and S.D. Houston, \u201cNew distributed algorithms for fast sign detection in residue number systems (RNS),\u201d J. Parallel Distrib. Comput., vol.97, pp.78-95, 2016. 10.1016\/j.jpdc.2016.06.005","DOI":"10.1016\/j.jpdc.2016.06.005"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] K. Nave, A.S. Molahosseini, and M. Esmaeildoust, \u201cHow to teach residue number system to computer scientists and engineers,\u201d IEEE Trans. Educ., vol.54, no.1, pp.156-163, Feb. 2011. 10.1109\/te.2010.2048329","DOI":"10.1109\/TE.2010.2048329"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] S. Kumar and C.-H, Chang, \u201cA new fast and area-efficient adder-based sign detector for RNS {2<i><sup>n<\/sup><\/i>-1, 2<i><sup>n<\/sup><\/i>,2<i><sup>n<\/sup><\/i>+1},\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.24, no.7, pp.2608-2612, 2016. 10.1109\/tvlsi.2016.2516522","DOI":"10.1109\/TVLSI.2016.2516522"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] L. Sousa and P. Martins, \u201cSign detection and number comparison on RNS 3-moduli sets {2<i><sup>n<\/sup><\/i>-1, 2<sup><i>n<\/i>+<i>x<\/i><\/sup>,2<i><sup>n<\/sup><\/i>+1},\u201d Circuits Syst. Signal Process., vol.36, no.3, pp.1224-1246, 2017. 10.1007\/s00034-016-0354-z","DOI":"10.1007\/s00034-016-0354-z"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] A. Hiasat, \u201cA reverse converter and sign detectors for an extended RNS five-moduli set,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers, vol.64, no.1, pp.111-121, 2017. 10.1109\/tcsi.2016.2612723","DOI":"10.1109\/TCSI.2016.2612723"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] N. Guillermin, \u201cA high speed coprocessor for elliptic curve scalar multiplications over \ud835\udd3d_<i>p<\/i>,\u201d CHES2010, LNCS6225, pp.48-64, Springer, 2010. 10.1007\/978-3-642-15031-9_4","DOI":"10.1007\/978-3-642-15031-9_4"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] G.X. Yao, J. Fan, R.C.C. Cheung, and I. Verbauwhede, \u201cNovel RNS parameter selection for fast modular multiplication,\u201d IEEE Trans. Comput., vol.63, no.8, pp.2099-2105, Aug. 2014. 10.1109\/tc.2013.92","DOI":"10.1109\/TC.2013.92"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] S. Kawamura, Y. Komano, H. Shimizu, and T. Yonemura, \u201cRNS Montgomery reduction algorithms using quadratic residuosity,\u201d J. Cryptogr. Eng., vol.9, pp.313-331, Springer, 2019. 10.1007\/s13389-018-0195-8","DOI":"10.1007\/s13389-018-0195-8"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] G.C. Cardarilli, M. Re, R. Lajacono, and G. Ferri, \u201cA systolic architecture for high-performance scaled residue to binary conversion,\u201d IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol.47, no.10, pp.1523-1526, 2000. 10.1109\/81.886982","DOI":"10.1109\/81.886982"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020CIP0020\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T05:31:14Z","timestamp":1670650274000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020CIP0020\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020cip0020","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}