International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration

Authors:
Andrey Kim , Samsung Advanced Institute of Technology
Ahmet Can Mert , Graz University of Technology
Anisha Mukherjee , Graz University of Technology
Aikata Aikata , Graz University of Technology
Maxim Deryabin , Samsung Advanced Institute of Technology
Sunmin Kwon , Samsung Advanced Institute of Technology
HyungChul Kang , Samsung Advanced Institute of Technology
Sujoy Sinha Roy , Graz University of Technology
Download:
Search ePrint
Search Google
Conference: CRYPTO 2024
Abstract: Recognizing the importance of a fast and resource-efficient polynomial multiplication in homomorphic encryption, in this paper, we design a \emph{multiplier-less} number theoretic transform using a Fermat number as an auxiliary modulus. To make this algorithm scalable with the degree of polynomial, we apply a univariate to multivariate polynomial ring transformation. We develop an accelerator architecture for fully homomorphic encryption using these algorithmic techniques for efficient multivariate polynomial multiplication. For practical homomorphic encryption application benchmarks, the hardware accelerator achieves a 1,200$\times$ speed-up compared to software implementations. Finally, we conclude the paper by discussing the advantages and limitations of the proposed polynomial multiplication method.
BibTeX
@inproceedings{crypto-2024-34335,
  title={Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration},
  publisher={Springer-Verlag},
  author={Andrey Kim and Ahmet Can Mert and Anisha Mukherjee and Aikata Aikata and Maxim Deryabin and Sunmin Kwon and HyungChul Kang and Sujoy Sinha Roy},
  year=2024
}