Re:Intro to Fully Homomorphic Encryption
by Nzen on Saturday July 04, 2020 @03:22PM
(#23734321)
The business card version, as I understand it, involves splitting our plaintext as bits, encrypt each, pass these 'bits' through a logical circuit equivalent to the desired computation (ex a full adder [0]), decrypt the 'bits', and reassemble them into the transformed plaintext. The advanced math comes in encrypting it by choosing values that they follow a lattice [1] .. maybe .. so that evaluating the circuit doesn't trash the encrypted bits.
[0] https://en.wikipedia.org/wiki/Adder_(electronics)#Full_adder
[1] https://en.wikipedia.org/wiki/Lattice_(group)