{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:55:47Z","timestamp":1775066147863,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2014]]},"DOI":"10.1109\/tc.2014.2345388","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T18:29:52Z","timestamp":1407263392000},"page":"1-1","source":"Crossref","is-referenced-by-count":54,"title":["Accelerating Fully Homomorphic Encryption in Hardware"],"prefix":"10.1109","author":[{"given":"Yarkin","family":"Doroz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erdinc","family":"Ozturk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"ref11","article-title":"Can Schönhage multiplication speed up the RSA decryption or encryption?","author":"garc\u00eda","year":"2005","journal-title":"Proc Conf Cryptology—MoraviaCrypt"},{"key":"ref12","article-title":"Super-sized multiplies: How do FPGAS fare in extended digit multipliers","author":"craven","year":"2004"},{"key":"ref13","first-page":"39","article-title":"An optimum design of FFT multi-digit multiplier and its VLSI","volume":"18","author":"yazaki","year":"2006","journal-title":"Bull Univ Electro-Communications"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/NEWCAS.2005.1496674"},{"key":"ref15","author":"gathen","year":"2003","journal-title":"Modern Computer Algebra"},{"key":"ref16","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":"w","year":"1965","journal-title":"Math Comput"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","article-title":"Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor","volume":"263","author":"barrett","year":"1987","journal-title":"Proc Adv Cryptology"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.336"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626410000259"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"ref3","first-page":"1","article-title":"An update on Sipher (scalable implementation of primitives for homomorphic encryption)–FPGA implementation using simulink","author":"cousins","year":"2012","journal-title":"Proc IEEE Conf High Perform Extreme Comput"},{"key":"ref6","first-page":"505","article-title":"Fully homomorphic encryption from ring-LWE and security for key dependent messages","volume":"6841","author":"brakerski","year":"2011","journal-title":"Proc Adv Cryptology"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"ref8","first-page":"129","article-title":"Implementing Gentry‘s fully-homomorphic encryption scheme","volume":"6632","author":"gentry","year":"2011","journal-title":"Proc Adv Cryptology"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214086"},{"key":"ref2","first-page":"169","article-title":"On data banks and privacy homomorphisms","author":"rivest","year":"1978","journal-title":"Foundations of Secure Computation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref9","first-page":"293","article-title":"Multiplication of many-digital numbers by automatic computers","author":"karatsuba","year":"1962","journal-title":"Proc USSR Acad Sci 145"},{"key":"ref20","article-title":"Generalized Mersenne numbers","author":"solinas","year":"1999"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80043-1"},{"key":"ref21","article-title":"A fully homomorphic encryption scheme","author":"gentry","year":"2009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408660"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263830"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7104223\/06871300.pdf?arnumber=6871300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:41:57Z","timestamp":1642005717000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6871300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2345388","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}