{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:54:40Z","timestamp":1761897280777,"version":"3.37.3"},"reference-count":30,"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":[{"DOI":"10.13039\/100010661","name":"EU H2020 RECIPE Project","doi-asserted-by":"publisher","award":["801137"],"award-info":[{"award-number":["801137"]}],"id":[{"id":"10.13039\/100010661","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.2989423","type":"journal-article","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T20:12:20Z","timestamp":1587499940000},"page":"75809-75821","source":"Crossref","is-referenced-by-count":41,"title":["Flexible and Scalable FPGA-Oriented Design of Multipliers for Large Binary Polynomials"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9951-062X","authenticated-orcid":false,"given":"Davide","family":"Zoni","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Galimberti","sequence":"additional","affiliation":[]},{"given":"William","family":"Fornaciari","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Gf2x Website","year":"2020","author":"brent","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2016.07.012"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2014.10.008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1147\/sj.294.0526"},{"key":"ref13","first-page":"293","article-title":"Multiplication of many-digital numbers by automatic computers","volume":"145","author":"karatsuba","year":"1962","journal-title":"Proc USSR Acad Sci USA"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79456-1_10"},{"journal-title":"NTL A library for doing number theory","year":"2020","author":"shoup","key":"ref15"},{"journal-title":"MPFQ—A Finite Field Library","year":"2020","author":"gaudry","key":"ref16"},{"article-title":"Intel carry-less multiplication instruction and its usage for computing the GCM, Revision 2.0","year":"2010","author":"gueron","key":"ref17"},{"year":"2020","key":"ref18","article-title":"Arm architecture reference manual"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2018.8464777"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25922-8_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85855-3_17"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS46596.2019.8964882"},{"key":"ref3","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"424","author":"mceliece","year":"1978","journal-title":"DSN Progress Rep"},{"journal-title":"LEDAcrypt Website","year":"2020","author":"baldi","key":"ref6"},{"article-title":"Design of LEDAkem and LEDApkc instances with tight parameters and bounded decryption failure rate","year":"0","author":"baldi","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2017.2677426"},{"journal-title":"BIKE Website","year":"2020","author":"aragon","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2355854"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.3151345"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2001.922163"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s41635-019-00087-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.63"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2015.0337"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2874662"},{"key":"ref25","first-page":"359","article-title":"Efficient FPGA-based Karatsuba multipliers for polynomials over \n$\\mathbb{F}_{2}$","author":"von zur gathen","year":"2005","journal-title":"Proc Int Workshop Sel Areas Cryptogr"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09075203.pdf?arnumber=9075203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:34Z","timestamp":1639770694000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9075203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2989423","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}