Sequential Prime Number Encryption Key Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptography techniques are limited by the inability to efficiently identify and utilize all prime numbers for encryption, leading to potential decryption vulnerabilities as computing resources increase, and are resource-intensive for large prime numbers.
Innovation Solution
A method for generating public and private encryption keys based on the next sequential prime number subsequent to a starting value, using calculations of moduli and difference values to determine prime numbers, allowing for the identification and use of all prime numbers for enhanced encryption security with minimal computational resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional prime number identification techniques (Sieve of Eratosthenes, trial-and-error method) are used, then prime numbers can be tested or identified, but the process is resource-intensive and cannot efficiently identify all prime numbers for cryptographic use
Solution Approach 1:
The patent changes the parameter approach from testing whether a number is prime to directly calculating the next prime number using the formula P(n) = P(n-1) + 1 + (1 - (P(n-1) mod P(n-2))). This transforms the identification process from a resource-intensive search to an efficient calculation based on previous prime numbers, dramatically reducing computational resources while improving productivity
Solution Approach 2:
The patent stores previously identified prime numbers in a database for future use. By maintaining a record of prime numbers P(n-1) and P(n-2), the system performs preliminary action to prepare the data needed for calculating the next prime number, eliminating the need to restart the identification process and reducing computational overhead
2Reliability
If known prime numbers are used for encryption, then encryption can be performed, but the set of available prime numbers is limited and vulnerability increases as computing resources improve
Solution Approach 1:
The patent implements a dynamic system that can continuously generate new prime numbers on demand using the recursive formula. Instead of relying on a static, limited set of known prime numbers, the system adapts by calculating P(n) from P(n-1) and P(n-2), providing an endless supply of prime numbers for encryption and maintaining security as computing resources improve
Solution Approach 2:
The patent creates a universal prime number generation system that can produce any prime number sequence P(n) based on the starting prime numbers. This multi-functional approach allows the same formula and database structure to generate prime numbers for various cryptographic applications, enhancing both reliability and adaptability
Data Source
AI summary
This disclosure describes providing message encryption through identification of sequential prime numbers. Encryption keys are generated, where a public encryption key is generated based on determining a lowest addend value to add to a starting value to produce a next sequential prime number with respect to the starting value. The public encryption key is provided to a computing device, and the computing device can use the public encryption key to encrypt a message. The encrypted message is received from the computing device and decrypted using a private key of the encryption keys that are generated.