Boolean-to-Arithmetic Masking Transition With Protected Carries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic methods fail to provide an effective transition from Boolean masking to arithmetic masking using a modulus with prime divisors other than 2, leaving cryptographic calculations vulnerable to intrusion attacks.
Innovation Solution
A method is introduced to transition from Boolean masking to arithmetic masking using a modulus (2m*p) where p has a prime divisor unequal to 2, incorporating carry protection through masking or balancing to thwart intrusion attacks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a transition from Boolean masking to arithmetic masking is performed using existing methods, then the cryptographic calculation can proceed with different masking rules, but the system becomes vulnerable to intrusion attacks due to unprotected carry operations
Solution Approach 1:
The transition method is divided into distinct phases: Boolean masking phase, transition phase with unprotected carries, and arithmetic masking phase. This segmentation allows each phase to be optimized independently, but creates security vulnerabilities at the transition boundaries where carries are exposed.
Solution Approach 2:
Random values are introduced as intermediaries to facilitate the transition between masking rules. These random values enable the mathematical transformation from Boolean to arithmetic masking while maintaining the ability to recover the original secret, but they also create additional attack surfaces during the transition process.
2Reliability
If carry protection mechanisms are implemented during masking transition, then security against intrusion attacks is improved, but the computational complexity and resource consumption increase
Solution Approach 1:
The patent applies preliminary protective measures by masking carries with random values before they can be observed during the transition process. This preliminary anti-action prevents intrusion attacks by ensuring that even if carries are exposed during calculation, they are already protected by random masking that prevents extraction of secret information.
Solution Approach 2:
Random values are prepared and applied to carries in advance of potential intrusion attempts. The masking of carries is performed as a preliminary step in the transition process, ensuring that security protection is in place before any vulnerable operations occur.
3Use of energy by moving object
If existing transition methods are used without carry protection, then resource consumption is reduced, but the cryptographic system becomes vulnerable to side-channel attacks
Solution Approach 1:
The patent converts the potentially harmful exposure of carries during transition into a beneficial security feature by masking them with random values. The carries that would normally be vulnerable to side-channel attacks are transformed into protected intermediate values that maintain security while still enabling the necessary computational transition.
Data Source
AI summary
A method is provided for re-masking from a Boolean mask to an arithmetic mask with a modulus (2m*p), in which m is an integer greater than or equal to zero, and p has at least one prime divisor unequal to 2, so that a carry is generated. The carry is masked or balanced to protect it against intrusion attacks.