{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:53:27Z","timestamp":1745038407437,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project","award":["RGP2\/552\/44"],"award-info":[{"award-number":["RGP2\/552\/44"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3403771","type":"journal-article","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T17:27:14Z","timestamp":1716312434000},"page":"72847-72859","source":"Crossref","is-referenced-by-count":2,"title":["FPGA Implementation of Elliptic-Curve Point Multiplication Over GF(2<sup>233<\/sup>) Using Booth Polynomial Multiplier for Area-Sensitive Applications"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4099-5025","authenticated-orcid":false,"given":"Amer","family":"Aljaedi","sequence":"first","affiliation":[{"name":"College of Computing and Information Technology, University of Tabuk, Tabuk, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Furqan Aziz","family":"Qureshi","sequence":"additional","affiliation":[{"name":"NASTP Alpha, Rawalpindi, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7945-9994","authenticated-orcid":false,"given":"Mohammad Mazyad","family":"Hazzazi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, College of Science, King Khalid University, Abha, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1900-6387","authenticated-orcid":false,"given":"Malik","family":"Imran","sequence":"additional","affiliation":[{"name":"Centre for Secure Information Technologies (CSIT), Queen&#x2019;s University Belfast, Belfast, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1172-885X","authenticated-orcid":false,"given":"Zaid","family":"Bassfar","sequence":"additional","affiliation":[{"name":"Department of Information Technology, University of Tabuk, Tabuk, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5852-1955","authenticated-orcid":false,"given":"Sajjad Shaukat","family":"Jamal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, College of Science, King Khalid University, Abha, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","volume-title":"Guide to Elliptic Curve Cryptography","author":"Hankerson","year":"2004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/mi14051037"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39799-x_31"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-023-05428-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1142\/s0218126619300034"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt.2018.5056"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3090216"},{"issue":"15","key":"ref9","doi-asserted-by":"crossref","first-page":"7079","DOI":"10.3390\/app11157079","article-title":"Elliptic-curve crypto processor for RFID applications","volume":"11","author":"Rashid","year":"2021","journal-title":"Appl. Sci."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2014.2387333"},{"issue":"10","key":"ref11","doi-asserted-by":"crossref","first-page":"17883","DOI":"10.3390\/s141017883","article-title":"Design of an elliptic curve cryptography processor for RFID tag chips","volume":"14","author":"Liu","year":"2014","journal-title":"Sensors"},{"issue":"11","key":"ref12","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.3390\/electronics10111252","article-title":"FPGA implementation of high-efficiency ECC point multiplication circuit","volume":"10","author":"Zhao","year":"2021","journal-title":"Electronics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3310354"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-018-02740-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3305271"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/8860413"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.ins.2020.03.069","article-title":"ECC2: Error correcting code and elliptic curve based cryptosystem","volume":"526","author":"Zhang","year":"2020","journal-title":"Inf. Sci."},{"key":"ref18","first-page":"1464","article-title":"Efficient implementation of elliptic curve cryptography using low-power digital signal processor","volume-title":"Proc. 12th Int. Conf. Adv. Commun. Technol. (ICACT)","volume":"2","author":"Malik"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/icdcs48716.2020.243562"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/icecs49266.2020.9294908"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/icecs.2013.6815481"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tie.2012.2186104"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/icosst.2017.8279005"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1016\/j.micpro.2022.104525","article-title":"An area-time efficient point-multiplication architecture for ECC over GF(2m) using polynomial basis","volume":"91","author":"Nadikuda","year":"2022","journal-title":"Microprocessors Microsystems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.23919\/ELECO47770.2019.8990437"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3282781"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS58634.2023.10382761"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2023.3321772"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3358213"},{"issue":"3","key":"ref30","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","article-title":"A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases","volume":"78","author":"Itoh","year":"1988","journal-title":"Inf. Comput."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/C-CODE.2017.7918952"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2023.3274931"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS52668.2021.9417065"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s41635-023-00134-2"},{"volume-title":"Recommended Elliptic Curves for Federal Government Use (1999)","year":"2024","key":"ref35"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10535481.pdf?arnumber=10535481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T04:27:43Z","timestamp":1716870463000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10535481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3403771","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}