Homomorphic Encryption Error Management for Bootstrapping Speed
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Fully homomorphic encryption is hindered by the lengthy computation time and large data handling requirements of bootstrapping, particularly due to the need for frequent Gate Bootstrapping operations, which significantly slow down processing.
Innovation Solution
The encryption processing apparatus reduces the number of homomorphic operations by limiting the error range in plaintexts, allowing for fewer Gate Bootstrapping processes, thereby speeding up the full adder operations and reducing overall processing time through parallel processing and optimized error management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Gate Bootstrapping is performed frequently to maintain error bounds in fully homomorphic encryption, then decryption reliability is improved, but computation time increases significantly
Solution Approach 1:
The patent performs Gate Bootstrapping in advance before the error accumulates to critical levels, rather than waiting until decryption reliability is compromised. This preliminary action allows the system to maintain reliability while avoiding the need for frequent emergency bootstrapping operations that would significantly increase computation time.
Solution Approach 2:
The patent implements a feedback mechanism that monitors error accumulation during homomorphic operations and dynamically determines when Gate Bootstrapping is necessary. This feedback-controlled approach ensures bootstrapping is performed only when needed to maintain decryption reliability, optimizing the balance between reliability and computation time.
2Productivity
If the number of Gate Bootstrapping operations is reduced to speed up processing, then computation time decreases, but error management becomes more difficult
Solution Approach 1:
The patent changes the error management parameter by establishing predetermined error bounds and using these bounds as the criterion for triggering Gate Bootstrapping. This parameter-based approach simplifies error management by providing clear, quantitative thresholds rather than requiring complex qualitative error assessment, enabling faster processing while maintaining可控 error levels.
Solution Approach 2:
The patent implements dynamic error management where the system adapts its bootstrapping frequency based on actual error accumulation patterns. This dynamic approach allows the system to reduce bootstrapping operations when error accumulation is slow, improving processing speed, while automatically increasing operations when needed to maintain security, thus managing complexity adaptively.
3Adaptability or versatility
If fully homomorphic encryption processes large amounts of data through multiple homomorphic operations, then functionality is improved, but the amount of computation increases
Solution Approach 1:
The patent applies partial action by performing Gate Bootstrapping only to the extent necessary to maintain predetermined error bounds, rather than performing it excessively or continuously. This partial action approach maintains the necessary homomorphic operation functionality while reducing unnecessary computation time associated with over-bootstrapping.
Data Source
AI summary
An encryption processing apparatus that processes a ciphertext, the apparatus including a processor that executes a process including: performing a homomorphic operation related to a predetermined operation for three or more of the ciphertexts for which an error range is set to make a range of an error added to a plaintext after the homomorphic operation fall within a predetermined value; and calculating a new ciphertext by applying a predetermined polynomial to a ciphertext that is a result of the homomorphic operation, wherein the calculation includes factorizing each of a plurality of the polynomials into a common polynomial common to the polynomials and an uncommon polynomial not common to the polynomials, and calculating a plurality of the new ciphertexts by using a plurality of ciphertexts calculated by applying the common polynomial to the result of homomorphic operation, and using the uncommon polynomial.