Modular Exponentiation Protection via Random Quantity Intermediary
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing solutions for protecting modular exponentiation calculations and elliptic curve operations against side channel attacks, such as DPA, are resource-intensive due to the high consumption of power and calculation time required for unmasking the random quantities used for masking.
Innovation Solution
A method that initializes a first variable with a random quantity and updates it using the quotient and product with another variable based on the exponent bits, followed by division by the random quantity to achieve modular exponentiation, reducing the number of multiplications and resource consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If random numbers are used to mask quantities manipulated by the algorithm, then security against side channel attacks is improved, but resource consumption (power, calculation time) increases
Solution Approach 1:
The patent introduces a random quantity as an intermediary element that masks the secret quantities during calculation. This random quantity is multiplied with the secret data before processing and then divided out after processing, serving as a mediator that protects the secret while being systematically eliminated. The intermediary approach allows security protection without requiring complex unmasking operations that would consume additional resources.
Solution Approach 2:
The patent changes the parameter of the random quantity from a general mask to specifically a power of two (2^k). This parameter change enables the random quantity to be represented efficiently in binary form, allowing multiplication and division operations to be performed as simple bit shifts rather than full arithmetic operations. This dramatically reduces the computational resources required for both the masking and unmasking operations.
2Reliability
If random numbers are used to mask quantities, then security against side channel attacks is improved, but calculation time increases
Solution Approach 1:
The random quantity serves as a temporary intermediary that is introduced at the beginning of the calculation and systematically removed at the end. During the modular exponentiation process, the random quantity remains embedded in the calculations but does not require complex real-time unmasking operations, allowing the core calculation to proceed efficiently while maintaining security throughout the process.
Solution Approach 2:
By setting the random quantity as a power of two, the patent transforms complex multiplication and division operations into simple bit shift operations. This parameter change reduces the computational complexity from O(n) full multiplication operations to O(1) bit shift operations, significantly decreasing the calculation time required for masking and unmasking while maintaining the security benefits.
3Ease of operation
If unmasking is performed in usual circuits, then the result can be exploited, but resource consumption (power, calculation time) increases significantly
Solution Approach 1:
The random quantity is designed as a systematic intermediary that can be cleanly removed after serving its protective function. The method ensures that the random quantity is embedded in a controlled manner during calculation and can be systematically divided out at the end, enabling result exploitation without requiring complex resource-intensive unmasking circuits.
Solution Approach 2:
The patent changes the parameter of the random quantity to a power of two, which enables the division operation to be performed as a simple right bit shift rather than a complex division circuit. This parameter change dramatically reduces the power consumption and circuit complexity required for the unmasking operation, making result exploitation efficient and practical.
Data Source
AI summary
A method for protecting a calculation, by an electronic circuit, of a modular exponentiation of a digital quantity, wherein: a first variable is initialized with a random quantity; at least one second variable is initialized with a value which is a function of the digital quantity; at least for a bit at 1 of an exponent of the modular exponentiation, the first variable is updated by: a) the quotient of its content and a power of the random quantity; and b) the product of its content by that of the second variable; and once all the exponent bits have been processed, the content of the first variable is divided by the random quantity to provide the result of the modular exponentiation.