Lattice-Based Cryptographic Information Compilation for Quantum Resistance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic systems based on RSA and ECC are vulnerable to attacks by quantum computers, necessitating the development of new cryptographic schemes that are resistant to such attacks.
Innovation Solution
The proposed solution involves a method for efficiently compiling cryptographic information using lattice-based cryptosystems, which operate on large matrices or polynomial rings, and employ rejection sampling with randomness to ensure security against quantum attacks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If RSA or ECC-based public key encryption is used, then efficient encryption and decryption can be achieved, but the system becomes vulnerable to quantum computer attacks
Solution Approach 1:
The patent transitions from classical cryptographic parameters (RSA/ECC based on factoring and discrete logarithm problems) to lattice-based cryptographic parameters (based on hard lattice problems like shortest vector problem). This parameter change enables quantum resistance while maintaining cryptographic functionality, resolving the vulnerability to quantum attacks without fundamentally changing the system architecture.
2Reliability
If lattice-based cryptosystems are implemented, then quantum resistance is achieved, but computational complexity and processing requirements increase
Solution Approach 1:
The patent performs preliminary computations during key generation to pre-process lattice-based cryptographic parameters. By preparing cryptographic information in advance and storing it securely, the system reduces real-time computational requirements during encryption and decryption operations, thereby lowering power consumption while maintaining quantum resistance.
3Speed
If cryptographic information is compiled and stored for later use, then processing speed during authentication is improved, but security risks increase if the stored information is compromised
Solution Approach 1:
The patent extracts and separates sensitive cryptographic materials from the main processing system. By compiling cryptographic information externally and storing only essential verification data in the authentication system, the patent reduces the attack surface while maintaining fast authentication processing. The sensitive key material remains outside the vulnerable environment.
4Reliability
If rejection sampling with randomness is used in lattice-based cryptography, then security against quantum attacks is enhanced, but the number of computations and time required increases
Solution Approach 1:
The patent applies rejection sampling selectively to critical portions of cryptographic information generation rather than all computations. By performing rejection sampling only where necessary to ensure quantum resistance and using predetermined thresholds, the system achieves adequate security without the full computational overhead of exhaustive rejection sampling, thereby reducing time loss.
Data Source
AI summary
Cryptographic information is compiled by: (a) determining a first portion of the cryptographic information based on an input and a randomness: (b) checking a rejection criterion based on the first portion; (b1) re-starting step (a) with a different randomness if the rejection criterion is fulfilled; (b2) if not all portions of the cryptographic information have been generated, determining a subsequent portion of the cryptographic information based on the input and the randomness and continuing with step (b) or, otherwise, continuing with step (c); (c) determining the first portion of the cryptographic information based on the input and the randomness; (d) conveying the respective portion of the cryptographic information; and (e) if not all portions of the cryptographic information have been generated, determining a subsequent portion of the cryptographic information based on the input and the randomness and continuing with step (d).


