The fully Homomorphic encryption scheme is corner stone of privacy electronic privacy in real life in more connected world. It allows to perform all kinds of computations on encrypted data. Although, time of computations are bottleneck of numerous applications of real life. In this paper, you aim to study the time of computations on multiple inputs encrypted adders with these schemes. Precisely, we present the TFHE scheme which have published by Illaria Chilloti and all. It belongs many kinds of logics gates as AND, OR, NAND. These logics gates are used to design circuit which represents four architectures of multiple encrypted inputs adders.Finally, we determine the best architecture of adder which is Carry Look-Ahead Adder (CLA). CLA reduce to fifteen precent (15%) time of computations of dedicated architecture like Wallace.
The full homomorphic encryption allows to the cloud for providing computations on encrypted data without decrypt them. Since the breakthrough of Gentry, this approach of cryptographic continue to tempt the scientific research and industries of New technologies of Information and Telecommunications. More recently, Léo Ducas and Daniele Micciancio were published a library called FHEW which allow to perform bootstrapping in less than a second.In this paper, we propose an implementation of basics arithmetic operations on unsigned integer. The improvement on circuit allows us to implement homomorphic computations on unsigned integers of 8, 16 and 32 bytes. The correspondents circuits of addition, subtraction, multiplication and division were rewritten in equivalents circuits using the universal gate NAND. The obtained result is hopeful for using homomorphic encryption in wide application which need privacy application in real life.
Show abstract
Full Text
