Small Memory Fast Elliptic Encryption for Secure Digital Signatures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing fast elliptic encryption (FEE) systems face challenges in implementing secure digital signature verification on memory-constrained devices due to high memory requirements.
Innovation Solution
The development of Small Memory Fast Elliptic Encryption (SFEE) systems, which utilize elliptic curves with specific parameters and arithmetic optimizations to reduce memory usage, allowing for efficient digital signature generation and verification on devices with limited resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional FEE systems are implemented, then digital signature verification security is maintained, but memory consumption increases
Solution Approach 1:
The patent applies parameter changes by modifying the elliptic curve parameters to use a prime field with a prime order curve, where the curve order is a prime number. This specific parameter selection enables the implementation of modular reduction operations that are more memory-efficient while maintaining the cryptographic security requirements for digital signature verification.
Solution Approach 2:
The patent extracts and eliminates unnecessary memory-intensive components from traditional FEE systems. By using a prime order curve and optimizing the modular reduction implementation, the system removes the need for large lookup tables and complex data structures, achieving secure digital signature verification with minimal memory footprint suitable for smart cards and mobile devices.
2Productivity
If optimized elliptic curve arithmetic is used, then processor cycles are reduced, but implementation complexity increases
Solution Approach 1:
The patent uses specific parameter changes including selecting a prime field with carefully chosen characteristics and a prime order curve. These parameter selections enable the use of optimized arithmetic operations that reduce processor cycles while keeping the implementation relatively simple through direct mathematical properties of the chosen parameters.
Solution Approach 2:
The patent segments the digital signature verification process into distinct modular operations: point multiplication on the elliptic curve, modular reduction of the result, and signature component generation. This segmentation allows each operation to be optimized independently, improving processor efficiency while maintaining clear and manageable implementation structure.
Data Source
AI summary
A method of generating a digital signature includes generating a first random number from a finite field of numbers, and generating field elements defining a first point on an elliptic curve defined over the finite field of numbers by performing elliptic curve arithmetic on the first random number and an initial public point on the elliptic curve. The method continues by generating a product from a field element, a private key, and a second random number received from a challenger seeking verification of a digital signature, and generating a signature component by summing the product and the first random number. The signature component is reduced using one or more modular reduction operations, using a modulus equal to an order of the elliptic curve, and then the reduced signature component and the field elements are sent to the challenger as a digital signature for verification by the challenger.