Elliptic Curve Point Verification via Polynomial Collinearity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic techniques based on elliptic curves are vulnerable to side-channel attacks, particularly error analysis, which require significant computing resources and memory, making them unsuitable for environments like smart cards and RFID chips where resources are limited.
Innovation Solution
A method is proposed to verify points on an elliptic curve by determining if they lie on a straight line using a polynomial evaluation, reducing computing effort and memory requirements, allowing for efficient verification even in environments with limited resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional verification methods are used to protect against side-channel attacks, then security is improved, but computing time and memory requirements increase significantly
Solution Approach 1:
The patent extracts only the essential verification step (checking if points lie on a straight line) from the complex traditional verification process. By focusing solely on the collinearity check using polynomial evaluation rather than full cryptographic verification, the method retains security functionality while dramatically reducing computing time and resource requirements.
Solution Approach 2:
The patent changes the verification parameter from comprehensive cryptographic validation to a simplified geometric property (collinearity of points). By verifying whether determined points lie on a straight line through polynomial evaluation instead of performing full elliptic curve verification, the method achieves adequate security with minimal computing overhead.
2Reliability
If traditional verification methods are used to protect against side-channel attacks, then security is improved, but memory requirements increase significantly
Solution Approach 1:
The patent extracts only the essential verification step (checking if points lie on a straight line) from the complex traditional verification process. By focusing solely on the collinearity check using polynomial evaluation rather than full cryptographic verification, the method retains security functionality while dramatically reducing computing time and resource requirements.
Solution Approach 2:
The patent changes the verification parameter from comprehensive cryptographic validation to a simplified geometric property (collinearity of points). By verifying whether determined points lie on a straight line through polynomial evaluation instead of performing full elliptic curve verification, the method achieves adequate security with minimal computing overhead.
3Measurement precision
If comprehensive verification is performed to ensure correctness, then accuracy is improved, but computing effort increases
Solution Approach 1:
The patent extracts only the essential verification step (checking if points lie on a straight line) from the complex traditional verification process. By focusing solely on the collinearity check using polynomial evaluation rather than full cryptographic verification, the method retains security functionality while dramatically reducing computing time and resource requirements.
Solution Approach 2:
The patent changes the verification parameter from comprehensive cryptographic validation to a simplified geometric property (collinearity of points). By verifying whether determined points lie on a straight line through polynomial evaluation instead of performing full elliptic curve verification, the method achieves adequate security with minimal computing overhead.
Data Source
AI summary
Conventional cryptographic methods that are based on elliptic curves are prone to side-channel attacks. Previously known methods for preventing side-channel attacks have the disadvantage of requiring high arithmetic capacity and a large amount of available memory space. The proposed method overcomes said disadvantage by using a process for verifying points on elliptic curves which saves arithmetic capacity and memory space.