{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:02:58Z","timestamp":1771488178464,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,5,19]],"date-time":"2016-05-19T00:00:00Z","timestamp":1463616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001230","name":"Macquarie University","doi-asserted-by":"publisher","award":["International Macquarie University Research Excellence Scholarship"],"award-info":[{"award-number":["International Macquarie University Research Excellence Scholarship"]}],"id":[{"id":"10.13039\/501100001230","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00034-016-0336-1","type":"journal-article","created":{"date-parts":[[2016,5,19]],"date-time":"2016-05-19T15:14:31Z","timestamp":1463670871000},"page":"1027-1051","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Highly Parallel Modular Multiplier for Elliptic Curve Cryptography in Residue Number System"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2668-7886","authenticated-orcid":false,"given":"Shahzad","family":"Asif","sequence":"first","affiliation":[]},{"given":"Yinan","family":"Kong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,19]]},"reference":[{"key":"336_CR1","unstructured":"O. Aichholzer, H. Hassler, A fast method for modulus reduction in residue number system. In: Proceedings Economical Parallel Processing, pp. 41\u201354. Vienna, Austria (1993)"},{"key":"336_CR2","doi-asserted-by":"publisher","unstructured":"H. Alrimeih, D. Rakhmatov, Pipelined modular multiplier supporting multiple standard prime fields. In: Application-specific Systems, Architectures and Processors (ASAP), 2014 IEEE 25th International Conference on, pp. 48\u201356 (2014). doi: 10.1109\/ASAP.2014.6868630","DOI":"10.1109\/ASAP.2014.6868630"},{"issue":"3","key":"336_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11265-014-0879-y","volume":"76","author":"S Ant\u00e3o","year":"2014","unstructured":"S. Ant\u00e3o, L. Sousa, A flexible architecture for modular arithmetic hardware accelerators based on RNS. J. Signal Process. Syst. 76(3), 249\u2013259 (2014). doi: 10.1007\/s11265-014-0879-y","journal-title":"J. Signal Process. Syst."},{"key":"336_CR4","doi-asserted-by":"publisher","unstructured":"S. Asif, Y. Kong, Design of an algorithmic Wallace multiplier using high speed counters. In: Computer Engineering Systems (ICCES), 2015 10th International Conference on, pp. 133\u2013138 (2015). doi: 10.1109\/ICCES.2015.7393033","DOI":"10.1109\/ICCES.2015.7393033"},{"key":"336_CR5","doi-asserted-by":"crossref","unstructured":"J.C. Bajard, L.S. Didier, P. Kornerup, Modular multiplication and base extensions in residue number systems. In: Proceedings 15th IEEE Symposium on Computer Arithmetic, vol. 2 pp. 59\u201365 (2001)","DOI":"10.1109\/ARITH.2001.930104"},{"key":"336_CR6","doi-asserted-by":"crossref","unstructured":"J.C., Bajard, L. Imbert, A full RNS implementation of RSA. IEEE Trans. Comput. 53(6), 769\u2013774 (2004)","DOI":"10.1109\/TC.2004.2"},{"key":"336_CR7","unstructured":"P. Barrett, Communications authentication and security using public key encryption\u2014a design for implementation. Master\u2019s thesis, Oxford University (1984)"},{"key":"336_CR8","doi-asserted-by":"crossref","unstructured":"P. Barrett, Implementing the Rivest, Shamir and Adleman public-key encryption algorithm on a standard digital signal processor, Advances in Cryptology - Crypto 86, vol. 263, Lecture Notes in Computer Science (Springer, Berlin\/Heidelberg, 1987), pp. 311\u2013323","DOI":"10.1007\/3-540-47721-7_24"},{"issue":"10","key":"336_CR9","doi-asserted-by":"crossref","first-page":"2427","DOI":"10.1109\/78.469842","volume":"43","author":"F Barsi","year":"1995","unstructured":"F. Barsi, M.C. Pinotti, Fast base extension and precise scaling in RNS for look-up table implementations. IEEE Trans. Signal Process. 43(10), 2427\u20132430 (1995)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"336_CR10","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/TCSI.2007.890623","volume":"54","author":"B Cao","year":"2007","unstructured":"B. Cao, C.H. Chang, T. Srikanthan, A residue-to-binary converter for a new five-moduli set. IEEE Trans. Circuits Syst. I Regul. Pap. 54(5), 1041\u20131049 (2007)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"336_CR11","doi-asserted-by":"crossref","unstructured":"R.C.C. Cheung, S. Duquesne, J. Fan, N. Guillermin, I. Verbauwhede, G.X. Yao, FPGA implementation of pairings using residue number system and lazy reduction, Proceedings of the 13th International Conference on Cryptographic Hardware and Embedded Systems, CHES\u201911 (Springer-Verlag, Berlin, Heidelberg, 2011), pp. 421\u2013441","DOI":"10.1007\/978-3-642-23951-9_28"},{"key":"336_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9316-0","volume-title":"Prime Numbers, A Computational Perspective","author":"R Crandall","year":"2001","unstructured":"R. Crandall, C. Pomerance, Prime Numbers, A Computational Perspective (Springer, Berlin, 2001)"},{"key":"336_CR13","unstructured":"J.F. Dhem, Modified version of the Barrett modular multiplication algorithm. Tech. rep, UCL Crypto Group, Louvain-la-Neuve (1994)"},{"key":"336_CR14","unstructured":"J.F. Dhem, Design of an efficient public-key cryptographic library for RISC based smart cards. Ph.D. thesis, Universit\u00e9 Catholique de Louvain (1998)"},{"key":"336_CR15","doi-asserted-by":"crossref","unstructured":"C. Doche, L. Imbert, Extended double-base number system with applications to elliptic curve cryptography. In: Progress in Cryptology - INDOCRYPT 2006, vol. 4329. Springer (2006)","DOI":"10.1007\/11941378_24"},{"key":"336_CR16","doi-asserted-by":"crossref","unstructured":"P.A. Findlay, B.A. Johnson, Modular exponentiation using recursive sums of residues, Advances in Cryptology\u2014Crypto 89, vol. 435, Lecture Notes in Computer Science. (Springer, Berlin\/Heidelberg, 1990), pp. 371\u2013386","DOI":"10.1007\/0-387-34805-0_35"},{"key":"336_CR17","doi-asserted-by":"crossref","unstructured":"W.L. Freking, K.K. Parhi, Modular multiplication in the residue number system with application to massively-parallel public-key cryptography systems. In: Proc. 34th Asilomar Conference on Signals, Systems and Computers, vol. 2, pp. 1339\u20131343 (2000)","DOI":"10.1109\/ACSSC.2000.911210"},{"issue":"8","key":"336_CR18","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1109\/TC.2012.84","volume":"61","author":"F Gandino","year":"2012","unstructured":"F. Gandino, F. Lamberti, G. Paravati, J. Bajard, P. Montuschi, An algorithmic and architectural study on Montgomery exponentiation in RNS. IEEE Trans. Comput. 61(8), 1071\u20131083 (2012). doi: 10.1109\/TC.2012.84","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"336_CR19","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/12.780883","volume":"48","author":"A Garcia","year":"1999","unstructured":"A. Garcia, A. Lloris, A look-up scheme for scaling in the RNS. IEEE Trans. Comput. 48(7), 748\u2013751 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"336_CR20","doi-asserted-by":"crossref","unstructured":"N. Guillermin, A high speed coprocessor for elliptic curve scalar multiplications over F $$_p$$ p , Proceedings of the 12th International Conference on Cryptographic Hardware and Embedded Systems, CHES\u201910 (Springer-Verlag, Berlin, Heidelberg, 2010), pp. 48\u201364","DOI":"10.1007\/978-3-642-15031-9_4"},{"key":"336_CR21","doi-asserted-by":"publisher","unstructured":"K. Javeed, X. Wang, Radix-4 and radix-8 Booth encoded interleaved modular multipliers over general Fp. In: Field Programmable Logic and Applications (FPL), 2014 24th International Conference on, pp. 1\u20136 (2014). doi: 10.1109\/FPL.2014.6927452","DOI":"10.1109\/FPL.2014.6927452"},{"key":"336_CR22","doi-asserted-by":"publisher","unstructured":"Javeed, K., Wang, X., Scott, M.: Serial and parallel interleaved modular multipliers on FPGA platform. In: Field Programmable Logic and Applications (FPL), 2015 25th International Conference on, pp. 1\u20134 (2015). doi: 10.1109\/FPL.2015.7293986","DOI":"10.1109\/FPL.2015.7293986"},{"issue":"4","key":"336_CR23","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TC.1978.1675105","volume":"27","author":"GA Jullien","year":"1978","unstructured":"G.A. Jullien, Residue number scaling and other operations using ROM arrays. IEEE Trans. Comput. 27(4), 325\u2013336 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"336_CR24","doi-asserted-by":"crossref","unstructured":"S. Kawamura, M. Koike, F. Sano, A. Shimbo, Cox-Rower architecture for fast parallel Montgomery multiplication. In: Advances in Cryptology\u2014Eurocrypt 2000, Lecture Notes in Computer Science, vol. 1807, pp. 523\u2013538. Springer (2000)","DOI":"10.1007\/3-540-45539-6_37"},{"key":"336_CR25","doi-asserted-by":"crossref","unstructured":"S.I. Kawamura, K. Hirano, A fast modular arithmetic algorithm using a residue table, Advances in Cryptology - Eurocrypt 88, vol. 330, Lecture Notes in Computer Science. (Springer, Berlin\/Heidelberg, 1988), pp. 245\u2013250","DOI":"10.1007\/3-540-45961-8_21"},{"key":"336_CR26","doi-asserted-by":"crossref","unstructured":"N. Koblitz, A Course in Number Theory and Cryptography. Graduate Texts in Mathematics 114. Springer-Verlag (1987)","DOI":"10.1007\/978-1-4684-0310-7"},{"issue":"1","key":"336_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00200-015-0268-1","volume":"27","author":"Y Kong","year":"2016","unstructured":"Y. Kong, S. Asif, M. Khan, Modular multiplication using the core function in the residue number system. Appl. Algebra Eng. Commun. Comput. 27(1), 1\u201316 (2016). doi: 10.1007\/s00200-015-0268-1","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"336_CR28","doi-asserted-by":"crossref","unstructured":"Y., Kong, B. Phillips, Residue number system scaling schemes. In: S.F. Al-Sarawi (ed.) Proc. SPIE, Smart Structures, Devices, and Systems II, vol. 5649, pp. 525\u2013536 (2005)","DOI":"10.1117\/12.582137"},{"issue":"11","key":"336_CR29","doi-asserted-by":"publisher","first-page":"1999","DOI":"10.1109\/TVLSI.2012.2227846","volume":"21","author":"SR Kuang","year":"2013","unstructured":"S.R. Kuang, J.P. Wang, K.C. Chang, H.W. Hsu, Energy-efficient high-throughput montgomery modular multipliers for RSA cryptosystems. IEEE Trans. VLSI Syst. 21(11), 1999\u20132009 (2013). doi: 10.1109\/TVLSI.2012.2227846","journal-title":"IEEE Trans. VLSI Syst."},{"issue":"1","key":"336_CR30","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TVLSI.2015.2391274","volume":"24","author":"H Marzouqi","year":"2016","unstructured":"H. Marzouqi, M. Al-Qutayri, K. Salah, D. Schinianakis, T. Stouraitis, A high-speed FPGA implementation of an RSD-based ECC processor. IEEE Trans. VLSI Syst. 24(1), 151\u2013164 (2016). doi: 10.1109\/TVLSI.2015.2391274","journal-title":"IEEE Trans. VLSI Syst."},{"issue":"170","key":"336_CR31","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"P.L. Montgomery, Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"5","key":"336_CR32","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1109\/TCSI.2010.2092133","volume":"58","author":"R Muralidharan","year":"2011","unstructured":"R. Muralidharan, C.H. Chang, Radix-8 Booth encoded modulo $$2 ^{n} -1$$ 2 n - 1 multipliers with adaptive delay for high dynamic range residue number system. IEEE Trans. Circuits Syst. I Regul. Pap. 58(5), 982\u2013993 (2011)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"9","key":"336_CR33","doi-asserted-by":"publisher","first-page":"2122","DOI":"10.1109\/TC.2013.89","volume":"63","author":"J Neto","year":"2014","unstructured":"J. Neto, A. Ferreira Tenca, W. Ruggiero, A parallel and uniform k -partition method for Montgomery multiplication. IEEE Trans. Comput. 63(9), 2122\u20132133 (2014). doi: 10.1109\/TC.2013.89","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"336_CR34","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/71.382314","volume":"6","author":"KC Posch","year":"1995","unstructured":"K.C. Posch, R. Posch, Modulo reduction in residue number systems. IEEE Trans. Parallel Distrib. Syst. 6(5), 449\u2013454 (1995)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"336_CR35","doi-asserted-by":"publisher","unstructured":"L. Rahimzadeh, M. Eshghi, S. Timarchi, Radix-4 implementation of redundant interleaved modular multiplication on FPGA. In: Electrical Engineering (ICEE), 2014 22nd Iranian Conference on, pp. 523\u2013526 (2014). doi: 10.1109\/IranianCEE.2014.6999599","DOI":"10.1109\/IranianCEE.2014.6999599"},{"issue":"2","key":"336_CR36","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"4","key":"336_CR37","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TCSI.2013.2283674","volume":"61","author":"D Schinianakis","year":"2014","unstructured":"D. Schinianakis, T. Stouraitis, Multifunction residue architectures for cryptography. IEEE Trans. Circuits Syst. I Regul. Pap. 61(4), 1156\u20131169 (2014). doi: 10.1109\/TCSI.2013.2283674","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"336_CR38","doi-asserted-by":"publisher","unstructured":"D. Schinianakis, T. Stouraitis, An RNS Barrett modular multiplication architecture. In: Circuits and Systems (ISCAS), 2014 IEEE International Symposium on, pp. 2229\u20132232 (2014). doi: 10.1109\/ISCAS.2014.6865613","DOI":"10.1109\/ISCAS.2014.6865613"},{"issue":"6","key":"336_CR39","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1109\/ASSP.1989.28063","volume":"37","author":"A Shenoy","year":"1989","unstructured":"A. Shenoy, R. Kumaseran, A fast and accurate RNS scaling technique for high speed signal processing. IEEE Trans. Acoust. Speech Signal Process. 37(6), 929\u2013937 (1989)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"2","key":"336_CR40","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/12.16508","volume":"38","author":"A Shenoy","year":"1989","unstructured":"A. Shenoy, R. Kumaseran, Fast base extension using a redundant modulus in RNS. IEEE Trans. Comput. 38(2), 292\u2013297 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"336_CR41","unstructured":"M.A. Soderstrand, W. Jenkins, G. Jullien, Residue number system arithmetic: Modern applications. Digital Signal Processing (1986)"},{"key":"336_CR42","volume-title":"Residue Arithmetic and its Applications to Computer Technology","author":"NS Szabo","year":"1967","unstructured":"N.S. Szabo, R.H. Tanaka, Residue Arithmetic and its Applications to Computer Technology (McGraw Hill, New York, 1967)"},{"issue":"4","key":"336_CR43","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/TC.1982.1675999","volume":"31","author":"FJ Taylor","year":"1982","unstructured":"F.J. Taylor, C.H. Huang, An autoscale residue multiplier. IEEE Trans. Comput. 31(4), 321\u2013325 (1982)","journal-title":"IEEE Trans. Comput."},{"issue":"24","key":"336_CR44","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1049\/el:19891115","volume":"25","author":"A Tomlinson","year":"1989","unstructured":"A. Tomlinson, Bit-serial modular multiplier. Electron. Lett. 25(24), 1664 (1989)","journal-title":"Electron. Lett."},{"key":"336_CR45","doi-asserted-by":"publisher","unstructured":"Y. Tong-jie, D. Zi-bin, Y. Xiao-Hui, Z. Qian-jin, An improved RNS Montgomery modular multiplier. In: Computer Application and System Modeling (ICCASM), 2010 International Conference on, vol. 10, pp. V10 144\u2013V10 147 (2010). doi: 10.1109\/ICCASM.2010.5622857","DOI":"10.1109\/ICCASM.2010.5622857"},{"key":"336_CR46","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/78.655432","volume":"46","author":"ZD Ulman","year":"1998","unstructured":"Z.D. Ulman, M. Czyzak, Highly parallel, fast scaling of numbers in nonredundant residue arithmetic. IEEE Trans. Signal Process. 46, 487\u2013496 (1998)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"336_CR47","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1109\/TC.2013.92","volume":"63","author":"G Yao","year":"2014","unstructured":"G. Yao, J. Fan, R. Cheung, I. Verbauwhede, Novel RNS parameter selection for fast modular multiplication. IEEE Trans. Comput. 63(8), 2099\u20132105 (2014). doi: 10.1109\/TC.2013.92","journal-title":"IEEE Trans. Comput."},{"key":"336_CR48","doi-asserted-by":"publisher","unstructured":"G. Zervakis, N. Eftaxiopoulos, K. Tsoumanis, N. Axelos, K. Pekmestzi, A high radix Montgomery multiplier with concurrent error detection. In: Design Test Symposium (IDT), 2014 9th International, pp. 199\u2013204 (2014). doi: 10.1109\/IDT.2014.7038613","DOI":"10.1109\/IDT.2014.7038613"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-016-0336-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-016-0336-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-016-0336-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-016-0336-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T20:18:16Z","timestamp":1567887496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-016-0336-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,19]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["336"],"URL":"https:\/\/doi.org\/10.1007\/s00034-016-0336-1","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,19]]}}}