Method and system for providing efficient quantum proof encryption using boolean gates with reduced bootstrapping
AssigneeCornami, Inc.
InventorDenis Ovchinnikov
Life of this patent
Estimating the term…
Loading patent…
AssigneeCornami, Inc.
InventorDenis Ovchinnikov
Estimating the term…
A system and method to reduce the number of bootstraps required for performing Boolean operations on ciphertexts using Fully Homomorphic Encryption over the Torus (tFHE). A modulo is determined for a plurality of encrypted ciphertexts. False is assigned to a first value and true is assigned to a second value. A Boolean expression including the plurality of ciphertexts is converted into a mathematical function and each of the possible outputs of the function is mapped to the first value or the second value. A first outcome value is assigned to the result of the mathematical function when the Boolean expression evaluates to true. A second outcome value is assigned to each of a set of results of the mathematical function when the Boolean expression evaluates to false. The number of bootstraps required is reduced based on only having to bootstrap the first and second outcome values.
A method to perform operations on ciphertext using Fully Homomorphic Encryption (FHE), the method comprising:
A system to perform operations on encrypted ciphertext using Fully Homomorphic Encryption (FHE) based on a determined modulo and an assignment of false to a first value and true to a second value, the system comprising:
A non-transitory computer readable medium having stored thereon software instructions that, when executed by a processor, cause the processor to:
Dependencies are inferred from the claim text.