{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:20:26Z","timestamp":1774365626748,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Ministry of Science and ICT (MSIT), South Korea"},{"name":"Information Technology Research Center (ITRC) support program","award":["IITP-2018-0-01396"],"award-info":[{"award-number":["IITP-2018-0-01396"]}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communication Technology Promotion","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2988379","type":"journal-article","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T20:25:51Z","timestamp":1587068751000},"page":"73898-73906","source":"Crossref","is-referenced-by-count":60,"title":["Area-Time Efficient Hardware Implementation of Modular Multiplication for Elliptic Curve Cryptography"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9686-5994","authenticated-orcid":false,"given":"MD. Mainul","family":"Islam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3754-3618","authenticated-orcid":false,"given":"MD. Selim","family":"Hossain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4876-6860","authenticated-orcid":false,"given":"MD.","family":"Shahjalal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7773-3523","authenticated-orcid":false,"given":"MOH. Khalid","family":"Hasan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1487-086X","authenticated-orcid":false,"given":"Yeong Min","family":"Jang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2009.2019415"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2016.12.005"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2015.2391274"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/cta.2295"},{"key":"ref14","first-page":"1","article-title":"Radix-4 and radix-8 booth encoded interleaved modular multipliers over general \n${\\text{F}}_{p}$","author":"javeed","year":"2014","journal-title":"Proc Int Conf Field Program Logic Appl (FPL)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2015.7293986"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2881444"},{"key":"ref17","article-title":"Recommendation for key management—Part 1: General (revision 4)","author":"barker","year":"2016"},{"key":"ref18","article-title":"Recommendations for discrete logarithm-based cryptography: Elliptic curve domain parameters","author":"chen","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2958491"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.169"},{"key":"ref27","first-page":"43","article-title":"Fast less recursive hardware for large number multiplication using Karatsuba–Ofman’s algorithm","volume":"2869","author":"nedjah","year":"2003","journal-title":"Computer and Information Sciences"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-012-0027-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2907298"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2878777"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2016.07.008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/cta.2498"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.148"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2010.2103190"},{"key":"ref1","author":"hankerson","year":"2004","journal-title":"Guide to Elliptic Curve Cryptography"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1228516"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/12.709376"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06734-6_14"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.502403","article-title":"Analyzing and comparing montgomery multiplication algorithms","volume":"16","author":"kaya koc","year":"1996","journal-title":"IEEE Micro"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.92"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00034-016-0336-1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09069237.pdf?arnumber=9069237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:32Z","timestamp":1642002992000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9069237\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2988379","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}