Fully Homomorphic Encryption on large integers

ePrint Report: Fully Homomorphic Encryption on large integers

Philippe Chartier, Michel Koskas, Mohammed Lemou, Florian Méhats

At the core of fully homomorphic encryption lies a procedure to refresh the ciphertexts whose noise component has grown too big. The efficiency of the so-called bootstrap is of paramount importance as it is usually regarded as the main bottleneck towards a real-life deployment of fully homomorphic crypto-systems. In two of the fastest implementations so far, the space of messages is limited to binary …

big called efficiency encryption eprint report fully homomorphic encryption homomorphic encryption large lies noise paramount procedure report