Open AccessImproved Bootstrapping by FFT on Encrypted Multi Operands Homomorphic Addition
Author(s) -
Paulin Boale B.,
Simon Ntumba,
Eugene Mbuyi M.
Publication year - 2021
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a3177.1011121
Subject(s) - computer science , operand , arithmetic , homomorphic encryption , encryption , fast fourier transform , adder , bootstrapping (finance) , bottleneck , cooley–tukey fft algorithm , parallel computing , algorithm , multiplication (music) , computer hardware , mathematics , embedded system , operating system , telecommunications , latency (audio) , combinatorics , econometrics
Bootstrapping is a technique that was introduced by Gentry in 2009. It is based on reencryption which allows an encryption scheme to perform an unlimited number of processing on encrypted data. It is a bottleneck in the practicability of these schemes because of multiplication operations which are costly in complexity. This complexity was reduced in TFHE by processing bootstrapping on the result of a two-bit logic gate in thirteen milliseconds using the Fast Fourier Transform. Building on this advance, an implementation of the addition of ten (10) numbers of 32-bits was performed based on the 32-bit Carry Look ahead Adder and was executed in less than 35 seconds using the configured SPQLIOS Fast Fourier transform to manipulate AVX and FMA instructions. This connector improves performance to a higher level than FFTW3 and NAYUKI.