Homomorphic Encryption Full Adder Using Multi-Value Ciphertexts
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing fully homomorphic encryption methods, such as TFHE, require numerous operations by full adders due to bit-wise type encryption, leading to inefficient processing times and impracticality due to extensive bootstrapping requirements.
Innovation Solution
Implement a multi-value logical operation using a full adder that reduces the number of computations by employing ternary Gate Bootstrapping, allowing temporary ciphertexts to have multiple values, thereby minimizing the number of Gate Bootstrapping operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If bit-wise type homomorphic encryption is used, then security and encryption capability are improved, but the number of ciphertexts required for processing increases and processing time becomes excessive
Solution Approach 1:
The patent transitions from bit-wise type homomorphic encryption (handling 1 bit per ciphertext) to integer-wise type homomorphic encryption (handling multi-value integers per ciphertext). This dimensional change allows processing multiple bits simultaneously through multi-value logical operations, significantly reducing the number of ciphertexts needed and accelerating processing speed while maintaining security through the fully homomorphic encryption framework
2Adaptability or versatility
If traditional full adder operations are used in bit-wise encryption, then logical operation capability is maintained, but the number of full adders required increases dramatically and processing time becomes impractical
Solution Approach 1:
The patent merges multiple bit-wise operations into a single integer-wise operation. By using multi-value logical operations on integer-wise ciphertexts, the system combines the functionality of multiple full adders into fewer operations, reducing the total number of logical operations required and thereby decreasing processing time while preserving full logical operation capability
Solution Approach 2:
The patent changes the parameter space of the encryption system from binary (2 values) to multi-value (more than 2 values). This parameter change enables integer-wise type homomorphic encryption to handle multiple bits simultaneously, reducing the number of full adder operations needed from O(n) to O(1) for n-bit integers, thus dramatically reducing processing time
Data Source
AI summary
To speed up an operation by a full adder that achieves full homomorphic encryption, a ciphertext processed by an encryption processing device has two values as a plaintext and is a ciphertext of fully homomorphic encryption that allows various operations to be performed by performing a logical operation without performing decryption. The encryption processing device includes an operation unit that performs a logical operation for a ciphertext received by a receiving unit and an output unit that outputs a result of the operation by the operation unit. The operation unit reduces the number of logical operations (homomorphic operations) by temporarily using a specific ciphertext that can have multiple values as a plaintext.