RLWE Decryption Coefficient Adjustment for Quantum Error Tolerance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Public key encryption algorithms, such as RSA, are vulnerable to quantum computers due to the Shor algorithm, and post-quantum cryptography faces security weaknesses, particularly in environments where the sizes of errors used in encryption devices limit the decryption process, leading to errors in message decryption.
Innovation Solution
A communication system employing a ring learning with errors (RLWE) encryption algorithm, where a decryption device modifies coefficients of a transmission message based on a comparison with a reference value to ensure secure decryption, independent of error sizes, using a determination function to adjust coefficients and perform modulo operations to restore the original message.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If post-quantum cryptography is used to secure against quantum computing threats, then security against quantum attacks is improved, but decryption errors occur due to error size limitations in the encryption device
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing multiple candidate decryption results corresponding to different possible error values. Before actual decryption occurs, the system prepares a lookup table of potential outcomes, allowing it to quickly identify the correct plaintext without being constrained by error size limitations during the decryption process itself.
Solution Approach 2:
The patent changes the parameter of error tolerance by implementing a decryption mechanism that can handle variable error sizes. Instead of being constrained by fixed error bounds, the system dynamically adjusts its decryption approach by selecting from pre-computed results that correspond to different error scenarios, effectively changing the error parameter handling from rigid to flexible.
2Reliability
If error sizes in encryption device are limited, then encryption security is improved, but decryption process becomes constrained and error-prone
Solution Approach 1:
The system performs preliminary computation by generating and storing multiple candidate decryption results in advance, each corresponding to different possible error values. This pre-computation allows the decryption process to be flexible and adaptable to various error sizes without requiring real-time computation, thus maintaining both security and versatility.
Solution Approach 2:
The patent introduces dynamics by making the decryption process adaptive rather than static. The system dynamically selects the appropriate decryption result from pre-computed candidates based on the actual error observed, allowing the decryption flexibility to adjust to different error conditions while maintaining encryption security.
3Productivity
If conventional decryption is used, then decryption speed is maintained, but decryption errors occur when error sizes exceed limits
Solution Approach 1:
The patent maintains high decryption speed by using pre-computed results stored in a lookup table. Instead of performing complex real-time computations to handle potential errors, the system quickly retrieves the appropriate decryption result from pre-prepared data, preserving speed while improving reliability through error tolerance.
Solution Approach 2:
The system applies beforehand cushioning by pre-calculating and storing multiple candidate decryption results that account for potential error variations. This preparatory measure cushions against decryption errors by having ready-made correction options available, ensuring both speed and accuracy without requiring slow real-time error correction computations.
Data Source
AI summary
Provided is a non-transitory computer readable medium. The non-transitory computer readable medium storing program code that, when is executed by a processor, causes the processor to calculate a message, based on a first cipher text, a second cipher text, and a private key, to compare a coefficient of the message with a reference value based on a prime number, to decide a coefficient of a modified message, based on a comparison result between the coefficient of the message and the reference value, and to decrypt the modified message.