Polynomial Distributed String Encryption for Quantum Resistance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional encryption techniques based on prime numbers are vulnerable to quantum computing algorithms like Shor's algorithm, which can efficiently factorize large numbers, threatening the security of modern computing systems.
Innovation Solution
A polynomial distributed string encryption system that uses pseudorandom number generators to create a data repository on each device, where messages are encrypted by generating a polynomial expression and a starting offset position, allowing only authorized devices to decrypt the message by searching within the identical data repository.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional prime number based encryption is used, then data can be encrypted for transmission with computationally efficient multiplication, but the encryption can be broken by quantum algorithms like Shor's algorithm that efficiently factorize large numbers
Solution Approach 1:
The patent replaces conventional prime number based encryption mechanisms with a polynomial-based encryption system. Instead of relying on the difficulty of factoring large primes, the system uses polynomial expressions evaluated at specific points modulo a prime, combined with large data repositories, to create encryption that is resistant to quantum factorization algorithms.
Solution Approach 2:
The patent changes the fundamental parameters of encryption from prime number pairs to polynomial expressions with multiple coefficients. The encryption security relies on the complexity of reversing polynomial evaluations without knowing the original coefficients, rather than on the difficulty of prime factorization.
2Productivity
If quantum computing methods are used to store data as continuous superposition of quantum states, then alternative solutions to prime number inefficiency are offered, but the integrity of conventional encryption techniques is undermined
Solution Approach 1:
The patent acknowledges the threat posed by quantum computing capabilities and converts this harmful factor into a benefit by designing an encryption system specifically resistant to quantum attacks. The polynomial-based approach with large data repositories creates a system where quantum superposition and parallel processing do not provide the same factorization advantages they do for conventional encryption.
3Reliability
If polynomial distributed strings with large data repositories are used, then encryption becomes resistant to quantum and classical computers, but the system complexity and data repository size requirements increase
Solution Approach 1:
The patent performs preliminary actions by pre-generating large data repositories containing polynomial evaluations before encryption is needed. These repositories are created in advance and stored locally on devices, eliminating the need for complex real-time computation during encryption and decryption operations.
Solution Approach 2:
The patent uses identical copies of the data repository stored on each device in the communication network. This allows any device to independently encrypt or decrypt messages without requiring centralized computation or complex coordination, simplifying the overall system architecture while maintaining quantum resistance.
Data Source
AI summary
An encryption system is provided. The system includes a plurality of communication devices, one or more processors, one or more memory components, one or more network connections, and a data repository. The data repository is stored by the plurality of communication devices on the one or more memory components thereof. A polynomial function is developed to point to message data within the data repository, wherein the polynomial function is transmitted between the plurality of communication devices to exchange the message data.