Montgomery Modular Multiplier Radix-2 Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional cryptosystems face challenges in enhancing processing speed for modular operations without complicating hardware, particularly in public key cryptographic algorithms, which require complex mathematical operations and are limited in processing high-speed data.
Innovation Solution
A scalable Montgomery modular multiplier is designed to support multiple precision operations using a radix-4 interleaved Montgomery multiplication algorithm, reducing hardware burden and enhancing computational performance by employing a carry save adding structure and carry propagation adder, allowing for efficient Montgomery multiplication and normal multiplication operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If radix value is increased to reduce iteration number, then processing speed is improved, but hardware complexity increases
Solution Approach 1:
The patent divides the multiplication process into multiple iterations with a smaller radix value (radix-2), breaking down the complex single-step radix-4 operation into simpler, more manageable steps. This segmentation reduces the complexity of each individual operation while maintaining overall processing efficiency through optimized iteration management.
Solution Approach 2:
The patent dynamically adjusts the operation flow based on intermediate results, using conditional logic to determine whether to perform addition or subtraction operations within each iteration. This dynamic adaptation allows the system to optimize processing speed without requiring complex fixed hardware for all possible operation paths.
2Productivity
If radix-4 operation algorithm is used to reduce iteration cycles, then productivity is improved, but device complexity increases due to additional processing steps
Solution Approach 1:
The patent segments the radix-4 multiplication into two radix-2 iterations, where each iteration handles simpler processing steps. This segmentation eliminates the need for complex radix-4 specific hardware while achieving similar or better performance through the simplified, step-by-step approach with optimized carry-save addition.
Solution Approach 2:
The patent performs preliminary transformations of the operands before the main multiplication process, preparing them in a format that simplifies the subsequent iterative operations. This preliminary action reduces the complexity of the main processing loop by pre-processing the input data to eliminate certain computational steps.
3Reliability
If complex mathematical operations are performed in public key cryptographic algorithms, then security is improved, but processing speed deteriorates
Solution Approach 1:
The patent replaces complex modular multiplication operations with a streamlined iterative algorithm that uses simple addition, subtraction, and bit-shifting operations. This substitution maintains the cryptographic security requirements while dramatically improving processing speed by eliminating complex mathematical computations in favor of simpler, faster operations.
Solution Approach 2:
The patent changes the operational parameters of the cryptographic algorithm by using a different computational approach (iterative radix-2 with carry-save addition) instead of traditional methods. This parameter change allows the same cryptographic function to be performed with improved efficiency while maintaining security integrity.
Data Source
AI summary
In a Montgomery multiplier, a modulus product generator may select a modulus product from a plurality of selectable n-bit modulus numbers M, a given modulus number M being formed from a currently input extended chunk of bits among the n-bit modulus numbers. A partial product generator may select a multiplicand number from a plurality of selectable n-bit multiplicands A as a partial product, a given multiplicand A being formed from a currently input extended chunk of bits among the n-bit multiplicands. An accumulator may accumulate the selected modulus product and partial product to generate a multiplication result. The Montgomery multiplier may be part of an operation unit that may include a memory and host, and may be adapted to perform a Montgomery multiplication operation and a normal multiplication operation based on a logic state of a control signal input thereto.