Cryptology ePrint Archive: Report 2021/480

Fast and Error-Free Negacyclic Integer Convolution using Extended Fourier Transform

Jakub Klemsa

Abstract: With the rise of lattice cryptography, (negacyclic) convolution has received increased attention. E.g., the NTRU scheme internally employs cyclic polynomial multiplication, which is equivalent to the standard convolution, on the other hand, many Ring-LWE-based cryptosystems perform negacyclic polynomial multiplication. A method by Crandall implements an efficient negacyclic convolution over a finite field of prime order using an extended Discrete Galois Transform (DGT) – a finite field analogy to Discrete Fourier Transform (DFT). Compared to DGT, the classical DFT runs faster by an order of magnitude, however, it suffers from inevitable rounding errors due to finite floating-point number representation. In a recent Fully Homomorphic Encryption (FHE) scheme by Chillotti et al. named TFHE, small errors are acceptable (although not welcome), therefore we decided to investigate the application of DFT for negacyclic convolution.

The primary goal of this paper is to suggest a method for fast negacyclic convolution over integer coefficients using an extended DFT. The key contribution is a thorough analysis of error propagation, as a result of which we derive parameter bounds that can guarantee even error-free results. We also suggest a setup that admits rare errors, which allows to increase the degree of the polynomials and/or their maximum norm at a fixed floating-point precision. Finally, we run benchmarks with parameters derived from a practical TFHE setup. We achieve around 24× better times than the generic NTL library (comparable to Crandall’s method) and around 4× better times than a naı̈ve approach with DFT, with no errors.

Category / Keywords: implementation / Negacyclic Convolution, Fast Fourier Transform, Fully Homomorphic Encryption

Original Publication (in the same form): CSCML 2021

Date: received 15 Apr 2021, last revised 4 May 2021

Contact author: klemsjak at fel cvut cz

Available format(s): PDF | BibTeX Citation

Note: Fixed bug in code, re-ran experiments.

Version: 20210504:132540 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]