{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:40:03Z","timestamp":1751092803539,"version":"3.41.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,25]]},"DOI":"10.1109\/iscas56072.2025.11043771","type":"proceedings-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T17:42:19Z","timestamp":1751046139000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Design of Cascade and One-Shot Mixed-Mode Recursive Multipliers for GF(2<sup>N<\/sup>) Polynomials"],"prefix":"10.1109","author":[{"given":"Vasanthi D","family":"R","sequence":"first","affiliation":[{"name":"International Institute of Information Technology,Bangalore,Karnataka,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daksh","family":"Sharma","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology,Bangalore,Karnataka,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanampudi Gopala Krishna","family":"Reddy","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology,Bangalore,Karnataka,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhav","family":"Rao","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology,Bangalore,Karnataka,India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2010.01.001"},{"article-title":"Hardware implementation of finite-field arithmetic","year":"2009","author":"Deschamps","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tcsi.2016.2614309"},{"article-title":"Guide to elliptic curve cryptography","year":"2004","author":"Hankerson","key":"ref4"},{"article-title":"Cryptography and network security: Principles and practice","year":"2010","author":"Stallings","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2007.364469"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1084"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2015.06.420"},{"key":"ref9","first-page":"274","article-title":"On karatsuba multiplication algorithm","volume-title":"The First International Symposium on Data, Privacy, and E-Commerce (ISDPE 2007)","author":"Fang"},{"key":"ref10","first-page":"1063","article-title":"A less recursive variant of karatsuba-ofman algorithm for multiplying operands of size a power of two","volume-title":"Proceedings of the 16th IEEE Symposium on Computer Arithmetic","author":"Koc"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2009.2020088"},{"key":"ref12","first-page":"8","article-title":"Overlap-free karatsuba-ofman polynomial multiplication algorithms","volume-title":"IET Inf. Secur.","volume":"4","author":"Fan","year":"2010"},{"key":"ref13","first-page":"636","article-title":"Obtaining more karatsuba-like formulae over the binary field","volume-title":"IACR Cryptol. ePrint Arch.","volume":"2009","author":"Fan","year":"2012"},{"key":"ref14","first-page":"38234","article-title":"Efficient implementation of karatsuba algorithm based three-operand multiplication over binary extension field","volume-title":"IEEE Access","volume":"6","author":"Lee","year":"2018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/12.293263"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/12.926154"},{"key":"ref17","first-page":"3125","article-title":"Efficient $m$ -ary exponentiation over gf(2n) using subquadratic ka-based three-operand montgomery multiplier","volume-title":"IEEE Transactions on Circuits and Systems I: Regular Papers","volume":"61","author":"Lee","year":"2014"},{"article-title":"Hybrid masked karat-suba multiplier for gf (2233)","year":"2007","author":"Rebeiro","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2022.3148207"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.49"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI59464.2023.10238681"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD58817.2023.00016"},{"key":"ref23","first-page":"1","article-title":"Hrm: m-term heterogeneous hybrid blend recursive multiplier for gf(2n) polynomial","volume-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","author":"R"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jare.2017.11.002"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD46524.2019.00013"}],"event":{"name":"2025 IEEE International Symposium on Circuits and Systems (ISCAS)","start":{"date-parts":[[2025,5,25]]},"location":"London, United Kingdom","end":{"date-parts":[[2025,5,28]]}},"container-title":["2025 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11043142\/11042930\/11043771.pdf?arnumber=11043771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:04:48Z","timestamp":1751090688000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11043771\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,25]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/iscas56072.2025.11043771","relation":{},"subject":[],"published":{"date-parts":[[2025,5,25]]}}}