Improved Bootstrapping by FFT on Encrypted Multi Operands Homomorphic Addition
- 30 October 2021
- journal article
- Published by Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP in International Journal of Engineering and Advanced Technology
- Vol. 11 (1), 126-131
- https://doi.org/10.35940/ijeat.a3177.1011121
Abstract
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.Keywords
This publication has 20 references indexed in Scilit:
- On Ideal Lattices and Learning with Errors over RingsJournal of the ACM, 2013
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-BasedLecture Notes in Computer Science, 2013
- Batch Fully Homomorphic Encryption over the IntegersLecture Notes in Computer Science, 2013
- Fully homomorphic SIMD operationsDesigns, Codes and Cryptography, 2012
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVPLecture Notes in Computer Science, 2012
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent MessagesLecture Notes in Computer Science, 2011
- Fully Homomorphic Encryption over the Integers with Shorter Public KeysLecture Notes in Computer Science, 2011
- Fully Homomorphic Encryption over the IntegersLecture Notes in Computer Science, 2010
- On Ideal Lattices and Learning with Errors over RingsLecture Notes in Computer Science, 2010
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing MinimaLecture Notes in Computer Science, 2009