Accelerating fully homomorphic encryption in hardware

Yarkin Doröz, Erdinç Öztürk, Berk Sunar

Research output: Contribution to journalArticlepeer-review

62 Scopus citations


We present a custom architecture for realizing the Gentry-Halevi fully homomorphic encryption (FHE) scheme. This contribution presents the first full realization of FHE in hardware. The architecture features an optimized multi-million bit multiplier based on the Schönhage Strassen multiplication algorithm. Moreover, a number of optimizations including spectral techniques as well as a precomputation strategy is used to significantly improve the performance of the overall design. When synthesized using 90 nm technology, the presented architecture achieves to realize the encryption, decryption, and recryption operations in 18.1 msec, 16.1 msec, and 3.1 sec, respectively, and occupies a footprint of less than 30 million gates.

Original languageEnglish (US)
Article number6871300
Pages (from-to)1509-1521
Number of pages13
JournalIEEE Transactions on Computers
Issue number6
StatePublished - Jun 1 2015
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


  • Fully homomorphic encryption
  • application specific hardware
  • cryptographic accelerators
  • large-integer multiplication


Dive into the research topics of 'Accelerating fully homomorphic encryption in hardware'. Together they form a unique fingerprint.

Cite this