Public Key Cryptography Using Linear Algebraic Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Public-key cryptographic techniques, such as RSA, require significant computational resources and large keys, making them impractical for low-cost and power-limited devices like smart cards, and existing alternatives like knapsack-based schemes are vulnerable to attacks.
Innovation Solution
A cryptographic method that uses linear algebraic operations to generate and reconstruct message keys and key recovery information, without performing exponentiation, ensuring security with lower computational load by maintaining entropy relationships between the seed, key recovery information, and message key.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If commonly-used public-key cryptographic techniques such as RSA are used, then security against cryptanalysis is ensured, but computational cost and memory requirements become excessively high
Solution Approach 1:
The patent changes the mathematical parameters from traditional RSA exponentiation operations to linear algebraic operations (matrix multiplication, vector operations) over finite fields. This parameter change maintains security through carefully selected field sizes and linear independence conditions while dramatically reducing computational complexity from O(log²n) to O(n³) operations, making it suitable for power-limited devices
Solution Approach 2:
The patent substitutes the mechanical exponentiation process with an equivalent linear algebraic system. Instead of performing repeated multiplication to achieve modular exponentiation, the system uses matrix-vector multiplications and linear combinations that achieve the same cryptographic goal with fewer computational steps, effectively replacing a computationally intensive mechanism with a more efficient one
2Reliability
If large keys are used to ensure security, then cryptanalysis resistance is improved, but memory and storage requirements increase
Solution Approach 1:
The patent changes the key representation parameters from large integer sequences required by RSA to compact matrix and vector structures over smaller finite fields. The public key consists of a matrix A and vector b with elements from Zp, where p is a relatively small prime, reducing the total number of bits required while maintaining security through the hardness of the linear algebra problem
3Power
If knapsack-based schemes are used to reduce computational burden, then power consumption is reduced, but vulnerability to lattice reduction attacks increases
Solution Approach 1:
The patent introduces asymmetry through the use of error vectors e that are hidden within the public key structure. The public key (A, b) appears to be a simple linear system, but the hidden error vectors create an asymmetric structure that provides security against lattice attacks. The private key contains the error vectors that make the system solvable, while their absence in the public key creates the security barrier
Solution Approach 2:
The error vectors e act as an intermediary element that mediates between the simple linear algebra operations and the security requirement. These vectors are embedded in the public key generation process and serve as the hidden structure that prevents lattice reduction attacks, while the linear algebra operations remain computationally efficient
Data Source
AI summary
A cryptographic method, comprising receiving a public key belonging to a message recipient having a private key corresponding to the public key, selecting a numerical seed, having a first entropy, using the numerical seed and the public key, generating key recovery information having a second entropy, which is less than the first entropy, and generating a message key having a third entropy, which is less than the first entropy, encrypting a message using the message key, and transmitting the encrypted message and the key recovery information to the message recipient, whereby the recipient reconstructs the message key using the key recovery information and the private key and decrypts the encrypted message using the reconstructed message key. Related systems and methods are also included.