Elliptic Curve Scalar Multiplication DPA Resistance via Dynamic Parameter Splitting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Elliptic Curve Scalar Multiplication operations are vulnerable to Differential Power Analysis (DPA) attacks, which can reveal the private key by measuring power consumption during the execution of cryptographic algorithms.
Innovation Solution
The method involves splitting the scalar into new parameters using techniques like Additive Splitting Using Subtraction, Additive Splitting Using Division, and Multiplicative Splitting, and using these new parameters to perform the Elliptic Curve Scalar Multiplication operation, thereby reducing the likelihood of revealing the private key to attackers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Elliptic Curve Scalar Multiplication is performed using traditional methods, then the operation can be completed efficiently, but the system becomes vulnerable to Differential Power_analysis attacks that can reveal the private key
Solution Approach 1:
The private key scalar is divided into multiple segments or parts. Instead of performing scalar multiplication directly with the complete private key, the operation is broken down into multiple smaller scalar multiplication operations with individual segments. This segmentation prevents attackers from extracting the complete private key through power analysis, as each segment alone is insufficient to compromise security.
Solution Approach 2:
The patent employs dynamic switching between different computational paths or methods during the scalar multiplication process. Randomized intermediate values and dynamic selection of computation sequences are used to ensure that power consumption patterns do not consistently reveal information about the private key, making DPA attacks ineffective.
2Reliability
If key-splitting parameters are changed frequently to counter DPA attacks, then security is enhanced, but the computational overhead and operation time increase
Solution Approach 1:
The private key is pre-split into segments before the actual cryptographic operation. Intermediate values and randomized parameters are prepared in advance. This preliminary preparation allows the main scalar multiplication to proceed more efficiently without repeated key splitting operations during execution, reducing overall computation time while maintaining security.
Solution Approach 2:
The patent changes certain parameters dynamically during computation (such as randomized intermediate values) while keeping the fundamental key segmentation structure intact. This selective parameter changing provides security against DPA attacks without requiring complete re-computation or frequent restructuring of the entire operation, thus balancing security enhancement with computational efficiency.
Data Source
AI summary
For an Elliptic Curve Scalar Multiplication (ECSM) operation to be performed on a scalar and a base point, a given previous set of parameters that was used to split the scalar for a previous ECSM operation and a selected random integer are used to determine a new set of parameters for splitting the scalar. By basing the new set of parameters on the previous set of parameters, repeated use of the scalar to determine key-splitting parameters is avoided and susceptibility to a Differential Power Analysis Side Channel attack is minimized.