{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:02:04Z","timestamp":1780675324438,"version":"3.54.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"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":[[2022,10,3]]},"DOI":"10.1109\/vlsi-soc54400.2022.9939657","type":"proceedings-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T20:41:50Z","timestamp":1667940110000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["High-Level Synthesis design approach for Number-Theoretic Multiplier"],"prefix":"10.1109","author":[{"given":"Alexander","family":"El-Kady","sequence":"first","affiliation":[{"name":"R.C. Athena,Industrial Systems Institute,Platani-Patras,Greece,26504"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Apostolos P.","family":"Fournaris","sequence":"additional","affiliation":[{"name":"R.C. Athena,Industrial Systems Institute,Platani-Patras,Greece,26504"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evangelos","family":"Haleplidis","sequence":"additional","affiliation":[{"name":"R.C. Athena,Industrial Systems Institute,Platani-Patras,Greece,26504"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vassilis","family":"Paliouras","sequence":"additional","affiliation":[{"name":"University of Patras,Electrical and Computer Engineering Department,Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DSD53832.2021.00058"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1976.1162854"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC50251.2020.00033"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/DSD53832.2021.00058"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex fourier series","volume":"19","author":"cooley","year":"1965","journal-title":"Mathematics of Computation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CISCE52179.2021.9445982"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SPL.2014.7002209"},{"key":"ref17","author":"millar","year":"2019","journal-title":"Design of a flexible schoenhage-strassen FFT polynomial multiplier with high-level synthesis"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2018.8357273"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICFPT47387.2019.00070"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33481-8_8"},{"key":"ref3","article-title":"Falcon: Fast-Fourier lattice-based compact signatures over NTRU","volume":"36","author":"fouque","year":"2018","journal-title":"Submission to the NIST's post-quantum cryptography standardization process"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2019.8741027"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2013.6581570"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LES.2019.2960457"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25510-7_2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI-SoC53125.2021.9607003"},{"key":"ref9","article-title":"An extensive study of flexible design methods for the number theoretic transform","author":"mert","year":"2020","journal-title":"IEEE Transactions on Computers"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44534-8_19"},{"key":"ref22","first-page":"191","article-title":"High-speed rsa hardware based on barret’s modular reduction method","author":"gro\u00dfsch\u00e4dl","year":"2000","journal-title":"International Workshop on Cryptographic Hardware and Embedded Systems"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.502403","article-title":"Analyzing and comparing montgomery multiplication algorithms","volume":"16","author":"koc","year":"1996","journal-title":"IEEE Micro"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2019.00045"}],"event":{"name":"2022 IFIP\/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)","location":"Patras, Greece","start":{"date-parts":[[2022,10,3]]},"end":{"date-parts":[[2022,10,5]]}},"container-title":["2022 IFIP\/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9939277\/9939284\/09939657.pdf?arnumber=9939657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T20:22:00Z","timestamp":1669666920000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9939657\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,3]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/vlsi-soc54400.2022.9939657","relation":{},"subject":[],"published":{"date-parts":[[2022,10,3]]}}}