{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:04:17Z","timestamp":1771488257714,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001863","name":"New Energy and Industrial Technology Development Organization","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001863","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s13389-018-0195-8","type":"journal-article","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T09:39:36Z","timestamp":1535967576000},"page":"313-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["RNS Montgomery reduction algorithms using quadratic residuosity"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1126-4645","authenticated-orcid":false,"given":"Shinichi","family":"Kawamura","sequence":"first","affiliation":[]},{"given":"Yuichi","family":"Komano","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Shimizu","sequence":"additional","affiliation":[]},{"given":"Tomoko","family":"Yonemura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"issue":"5","key":"195_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.382314","volume":"6","author":"KC Posch","year":"1995","unstructured":"Posch, K.C., Posch, R.: Modulo reduction in residue number systems. IEEE Trans. Parallel Distrib. Syst. 6(5), 449\u2013454 (1995)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"7","key":"195_CR2","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0167-4048(99)80061-3","volume":"17","author":"J Schwemmlein","year":"1998","unstructured":"Schwemmlein, J., Posch, K.C., Posch, R.: RNS-modulo reduction upon a restricted base value set and its applicability to RSA cryptography. Comput. Secur. 17(7), 637\u2013650 (1998)","journal-title":"Comput. Secur."},{"key":"195_CR3","doi-asserted-by":"crossref","unstructured":"Kawamura, S., Koike, M., Sano, F., Shimbo, A.: Cox-rower architecture for fast parallel Montgomery multiplication. In: EUROCRYPT2000, LNCS1807, pp. 523\u2013538. Springer (2000)","DOI":"10.1007\/3-540-45539-6_37"},{"key":"195_CR4","doi-asserted-by":"crossref","unstructured":"Nozaki, H., Motoyama, M., Shimbo, A., Kawamura, S.: Implementation of RSA algorithm based on RNS Montgomery multiplication. In: CHES2001, LNCS2162, pp. 364\u2013376. Springer (2001)","DOI":"10.1007\/3-540-44709-1_30"},{"issue":"6","key":"195_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TC.2004.2","volume":"53","author":"J-C Bajard","year":"2004","unstructured":"Bajard, J.-C., Imbert, L.: A full RNS implementation of RSA. IEEE Trans. Comput. (Brief Contrib.) 53(6), 769\u2013774 (2004)","journal-title":"IEEE Trans. Comput. (Brief Contrib.)"},{"issue":"8","key":"195_CR6","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1109\/TC.2012.84","volume":"61","author":"F Gandino","year":"2012","unstructured":"Gandino, F., Lamberti, F., Paravati, G., Bajard, J.-C., Montuschi, P.: An algorithmic and architectural study of Montgomery exponentiation in RNS. IEEE Trans. Comput. 61(8), 1071\u20131083 (2012)","journal-title":"IEEE Trans. Comput."},{"key":"195_CR7","doi-asserted-by":"crossref","unstructured":"Schinianakis, D.M., Kakarountas, A.P., Stouraitis, T.: A new approach to elliptic curve cryptography: an RNS architecture. In: Proceedings of IEEE MELECON 2006, May 16\u201319, Benalmadena (Malaga), Spain, pp. 1241\u20131245 (2006)","DOI":"10.1109\/MELCON.2006.1653327"},{"issue":"6","key":"195_CR8","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1109\/TCSI.2008.2008507","volume":"56","author":"DM Schinianakis","year":"2009","unstructured":"Schinianakis, D.M., Fournaris, A.P., Michail, H.E., Kakarountas, A.P., Souraitis, T.: An RNS implementation of an Fp elliptic curve point multiplier. IEEE Trans. Circuits Syst. 56(6), 1202\u20131213 (2009)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"195_CR9","doi-asserted-by":"crossref","unstructured":"Guillermin, N.: A high speed coprocessor for elliptic curve scalar multiplications over Fp. In: CHES2010, LNCS6225, pp. 48\u201364. Springer (2010)","DOI":"10.1007\/978-3-642-15031-9_4"},{"issue":"5","key":"195_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1093\/comjnl\/bxr119","volume":"55","author":"S Ant\u00e3o","year":"2012","unstructured":"Ant\u00e3o, S., Bajard, J.-C., Sousa, L.: RNS-based elliptic curve point multiplication for massive parallel architectures. Comput. J. 55(5), 629\u2013647 (2012)","journal-title":"Comput. J."},{"issue":"4","key":"195_CR11","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TCSI.2013.2283674","volume":"61","author":"DM Schinianakis","year":"2014","unstructured":"Schinianakis, D.M., Souraitis, T.: Multifunction residue architectures for cryptography. IEEE Trans. Circuits Syst. 61(4), 1156\u20131169 (2014)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"195_CR12","doi-asserted-by":"crossref","unstructured":"Bigou, K., Tisserand, A.: RNS modular multiplication through reduced base extensions. In: ASAP, pp. 57\u201362. IEEE (2014)","DOI":"10.1109\/ASAP.2014.6868631"},{"key":"195_CR13","doi-asserted-by":"crossref","unstructured":"Bajard, J.-C., Merkiche, N.: Double level Montgomery cox-rower architecture, new bounds. In: Smart Card Research and Advanced Applications (CARDIS), LNCS 8968, pp. 139\u2013153. Springer (2015)","DOI":"10.1007\/978-3-319-16763-3_9"},{"key":"195_CR14","doi-asserted-by":"crossref","unstructured":"Bigou, K., Tisserand, A.: Single base modular multiplication for efficient hardware RNS implementations of ECC. In: CHES2015, LNCS9293, pp. 123\u2013140. Springer (2015)","DOI":"10.1007\/978-3-662-48324-4_7"},{"key":"195_CR15","doi-asserted-by":"crossref","unstructured":"Cheung, R., Duquesne, S., Fan, J., Guillermin, N., Verbauwhede, I., Yao, G.: FPGA implementation of pairing using residue number system and lazy reduction. In: CHES2011, LNCS6917, pp. 421\u2013441. Springer (2011)","DOI":"10.1007\/978-3-642-23951-9_28"},{"key":"195_CR16","doi-asserted-by":"crossref","unstructured":"Yao, G.X., Fan, J., Cheung, R.C.C., Verbauwhede, I.: Faster pairing coprocessor architecture. In: Pairing 2012, LNCS 7708, pp. 160\u2013176. Springer (2012)","DOI":"10.1007\/978-3-642-36334-4_10"},{"key":"195_CR17","doi-asserted-by":"crossref","unstructured":"Bigou, K., Tisserand, A.: Improving modular inversion in RNS using the plus-minus methods. In: CHES 2013, LNCS8086, pp. 233\u2013249. Springer (2013)","DOI":"10.1007\/978-3-642-40349-1_14"},{"key":"195_CR18","unstructured":"Bajard, J.-C., Eynard, J., Merkiche, N., Plantard, T.: RNS arithmetic approach in lattice-based cryptography. In: 22nd IEEE Symposium on Computer Arithmetic (2015)"},{"key":"195_CR19","doi-asserted-by":"crossref","unstructured":"G\u00e9rard, B., Kammerer, J.-G., Merkiche, N.: Contribution to the design of RNS architecture. In: 22nd IEEE Symposium on Computer Arithmetic (2015)","DOI":"10.1109\/ARITH.2015.25"},{"issue":"3","key":"195_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s13389-017-0154-9","volume":"8","author":"Jean-Claude Bajard","year":"2017","unstructured":"Bajard, J.-C., Eynard, J., Merkiche, N.: Montgomery reduction within the context of residue number system arithmetic. Special Issue on Montgomery Arithmetic. J. Cryptogr. Eng. https:\/\/doi.org\/10.1007\/s13389-017-0154-9","journal-title":"Journal of Cryptographic Engineering"},{"issue":"170","key":"195_CR21","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"195_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-319-41385-3_8","volume-title":"Residue Number Systems","author":"P. V. Ananda Mohan","year":"2016","unstructured":"Ananda Mohan, P.V.: Residue Number Systems\u2014Theory and Applications. Birkh\u00e4user. ISBN: 978-3-319-41383-9(2016)"},{"key":"195_CR23","unstructured":"Kawamura, S., Yonemura, T., Komano, Y., Shimizu, H.: Exact error bound of cox-rower architecture for RNS arithmetic. Cryptology ePrint Archive: Report 2016\/266, March (2016). https:\/\/eprint.iacr.org\/2016\/266"},{"key":"195_CR24","unstructured":"Federal Information Processing Standards Publication: FIPS186-4 \u201cDigital Signature Standard (DSS).\u201d Appendix D, National Institute of Standards and Technology, July (2013)"},{"key":"195_CR25","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Public Key Cryptography\u2014PKC 2006, LNCS 3958, pp. 207\u2013228. Springer (2006)","DOI":"10.1007\/11745853_14"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0195-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-018-0195-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0195-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T20:28:51Z","timestamp":1751833731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-018-0195-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["195"],"URL":"https:\/\/doi.org\/10.1007\/s13389-018-0195-8","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"10 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}