Elliptic Curve Point Transformations for Side-Channel Attack Resistance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Elliptic curve cryptography systems are vulnerable to side-channel attacks, such as power analysis and electromagnetic analysis, which can reveal secret keying material by monitoring power consumption or electromagnetic radiation during cryptographic operations, and conventional countermeasures like inserting dummy operations can slow down the cryptographic process.
Innovation Solution
Transforming point coordinates from a first coordinate system to a second system using a linear transformation matrix with fixed, variable, or random coefficients, and performing field operations on the transformed coordinates to mask secret keying material and protect against side-channel attacks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If dummy cryptographic operations are inserted to protect against side-channel attacks, then security against power analysis attacks is improved, but cryptographic processing speed deteriorates
Solution Approach 1:
The patent transforms point coordinates between different coordinate systems (e.g., affine to projective coordinates) using mathematical transformation equations. This changes the representation parameters of the elliptic curve points, allowing field operations to be performed in a coordinate system that provides better resistance to side-channel attacks while maintaining computational efficiency through optimized transformation algorithms
Solution Approach 2:
The patent introduces transformation matrices and intermediate coordinate representations as mediators between the original point coordinates and the final computation results. These intermediaries mask the actual secret key operations by transforming them into equivalent operations in a different coordinate space, preventing direct observation of power consumption patterns while avoiding the need for dummy operations
2Reliability
If point coordinates are transformed using a linear transformation matrix, then security against side-channel attacks is improved, but computational complexity increases
Solution Approach 1:
The patent applies linear transformation matrices with carefully selected coefficients to convert point coordinates between different representations. The transformation equations use fixed or pre-computed matrix coefficients that simplify the computational process, ensuring that while the coordinate representation changes, the underlying mathematical operations remain efficient and do not significantly increase device complexity
Solution Approach 2:
The patent performs coordinate transformations at predetermined stages of the cryptographic algorithm (e.g., before point multiplication or addition operations). By pre-transforming coordinates to the appropriate system before operations and transforming back after operations, the patent integrates the transformation steps into the existing algorithm flow without requiring separate complex processing stages
Data Source
AI summary
In an elliptic curve cryptographic system, point coordinates in a first coordinate system are transformed into a second coordinate system. The transformed coordinates are processed by field operations, which have been modified for operating on the transformed point coordinates. In some implementations, the point coordinates are transformed using a linear transformation matrix having coefficients. The coefficients can be fixed, variable or random. In some implementations, the transformation matrix is invertible.