Secure Conjugate Gradient Method Scaling Factor Overflow Prevention
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The conjugate gradient method using a fixed-point number is prone to overflow during computation, which prevents the attainment of accurate results.
Innovation Solution
A secure conjugate gradient method computation system that employs a series of secure computation units to manipulate input values using a scaling factor D (|D| < 1) to keep intermediate values small, thereby reducing the likelihood of overflow.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a fixed-point number is used in the conjugate gradient method, then the computational cost is reduced, but the probability of overflow increases
Solution Approach 1:
The patent applies preliminary action by pre-multiplying intermediate computation values by a scaling factor D (where |D| < 1) before they can grow too large. This proactive scaling prevents overflow from occurring in the first place, while still allowing the use of fixed-point arithmetic to maintain low computational cost.
Solution Approach 2:
The patent changes the parameter of intermediate values by introducing a scaling factor D that multiplies these values during computation. This parameter change ensures that values remain within the representable range of fixed-point numbers, preventing overflow while maintaining computational efficiency.
2Measurement precision
If a floating-point number is used in secure computation, then the computational accuracy is maintained, but the computational cost increases significantly
Solution Approach 1:
The patent changes the numerical representation parameter from floating-point to fixed-point arithmetic in secure computation. By配合 with the scaling factor D, this parameter change maintains sufficient computational accuracy while dramatically reducing the computational cost associated with floating-point operations in secure computation protocols.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
An initialization unit (12) generates secret values of vectors p→0 and r→0 and a value ρ0. A first computation unit (13) generates a secret value of a D-fold value of a vector a→i-1.A second computation unit (14) generates a secret value of a D-fold value of a value γi-1. A third computation unit (15) generates a secret value of a value αi-1. A fourth computation unit (16) generates a secret value of a D-fold value of a vector d→i. A fifth computation unit (17) generates a secret value of a vector x→i. A sixth computation unit (18) generates a secret value of a vector r→i. A seventh computation unit (19) generates a secret value of a D-fold value of a value ρi. An eighth computation unit (20) generates a secret value of a value βi. A ninth computation unit (21) generates a secret value of a vector p→i.