Accelerating integer-based fully homomorphic encryption using Comba multiplication

Ciara Moore, Máire O'Neill, Neil Hanley, Elizabeth O'Sullivan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)
321 Downloads (Pure)

Abstract

Fully Homomorphic Encryption (FHE) is a recently developed cryptographic technique which allows computations on encrypted data. There are many interesting applications for this encryption method, especially within cloud computing. However, the computational complexity is such that it is not yet practical for real-time applications. This work proposes optimised hardware architectures of the encryption step of an integer-based FHE scheme with the aim of improving its practicality. A low-area design and a high-speed parallel design are proposed and implemented on a Xilinx Virtex-7 FPGA, targeting the available DSP slices, which offer high-speed multiplication and accumulation. Both use the Comba multiplication scheduling method to manage the large multiplications required with uneven sized multiplicands and to minimise the number of read and write operations to RAM. Results show that speed up factors of 3.6 and 10.4 can be achieved for the encryption step with medium-sized security parameters for the low-area and parallel designs respectively, compared to the benchmark software implementation on an Intel Core2 Duo E8400 platform running at 3 GHz.
Original languageEnglish
Title of host publicationProceedings of 2014 IEEE Workshop on Signal Processing Systems (SiPS)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages6
ISBN (Print) 9781479965885
DOIs
Publication statusPublished - Oct 2014
Event2014 IEEE Workshop on Signal Processing Systems, SiPS 2014 - Belfast, United Kingdom
Duration: 20 Oct 201422 Oct 2014

Conference

Conference2014 IEEE Workshop on Signal Processing Systems, SiPS 2014
CountryUnited Kingdom
CityBelfast
Period20/10/201422/10/2014

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Applied Mathematics
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Accelerating integer-based fully homomorphic encryption using Comba multiplication'. Together they form a unique fingerprint.

  • Cite this

    Moore, C., O'Neill, M., Hanley, N., & O'Sullivan, E. (2014). Accelerating integer-based fully homomorphic encryption using Comba multiplication. In Proceedings of 2014 IEEE Workshop on Signal Processing Systems (SiPS) [ 6986063] Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/SiPS.2014.6986063