{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T03:30:19Z","timestamp":1762054219473,"version":"build-2065373602"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T00:00:00Z","timestamp":1652572800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T00:00:00Z","timestamp":1652572800000},"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,5,15]]},"DOI":"10.1109\/fccm53951.2022.9786090","type":"proceedings-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T19:48:36Z","timestamp":1654285716000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["Low-Latency Modular Exponentiation for FPGAs"],"prefix":"10.1109","author":[{"given":"Martin","family":"Langhammer","sequence":"first","affiliation":[{"name":"Intel Corporation,UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Gribok","sequence":"additional","affiliation":[{"name":"Intel Corporation,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdan","family":"Pasca","sequence":"additional","affiliation":[{"name":"Intel Corporation,France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2009.5272296"},{"key":"ref3","first-page":"311","article-title":"Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard Digital Signal Processor","author":"barrett","year":"1987","journal-title":"Advances in Cryptology — CRYPTO’ 86"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"1902","DOI":"10.1109\/TCSI.2020.2966755","article-title":"Design and implementation of a low-latency modular multiplication algorithm","volume":"67","author":"\u00f6zt\u00fcrk","year":"2020","journal-title":"IEEE Transactions on Circuits and Systems I Regular Papers"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2018.8464809"},{"journal-title":"LogiCORE IP Complex Multiplier v3 1","year":"2011","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1723112.1723123"},{"key":"ref8","article-title":"Generalizations of the karatsuba algorithm for efficient implementations","author":"weimerskirch","year":"2006","journal-title":"Tech Rep"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.7763\/IJCEE.2013.V5.659"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3431920.3439306"},{"year":"0","key":"ref1","article-title":"VDF Alliance FPGA competition"}],"event":{"name":"2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","start":{"date-parts":[[2022,5,15]]},"location":"New York City, NY, USA","end":{"date-parts":[[2022,5,18]]}},"container-title":["2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9786061\/9786064\/09786090.pdf?arnumber=9786090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T21:02:10Z","timestamp":1656363730000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9786090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,15]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/fccm53951.2022.9786090","relation":{},"subject":[],"published":{"date-parts":[[2022,5,15]]}}}