PolyFHEmus: Rethinking Multiplication in Fully Homomorphic Encryption

Charles Gouert; Nektarios Georgios Tsoutsos

Paper 2024/1090

PolyFHEmus: Rethinking Multiplication in Fully Homomorphic Encryption

Charles Gouert

, University of Delaware

Nektarios Georgios Tsoutsos

, University of Delaware

Abstract

Homomorphic encryption is a powerful technology that solves key privacy concerns in cloud computing by enabling computation on encrypted data. However, it has not seen widespread adoption due to prohibitively high latencies. In this article, we identify polynomial multiplication as a bottleneck and investigate alternative algorithms to accelerate encrypted computing.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint.
Keywords: Homomorphic encryption Hardware acceleration Polynomial multiplication Secure computing
Contact author(s): cgouert @ udel edu
tsoutsos @ udel edu
History: 2024-07-05: approved; 2024-07-04: received; See all versions
Short URL: https://ia.cr/2024/1090
License: CC BY

BibTeX

@misc{cryptoeprint:2024/1090,
      author = {Charles Gouert and Nektarios Georgios Tsoutsos},
      title = {{PolyFHEmus}: Rethinking Multiplication in Fully Homomorphic Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2024/1090},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/1090}},
      url = {https://eprint.iacr.org/2024/1090}
}