Elliptical Curve Encryption Key Deletion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data encryption systems are vulnerable to hackers accessing secret keys stored on computers, allowing unauthorized users to decrypt encrypted data, and periodic key changes are burdensome and do not protect previously compromised data.
Innovation Solution
A method using elliptical curve cryptography to generate and manage keys, where a sender encrypts data with a randomly generated key, deletes it after encryption, and transmits encrypted data along with parameters to a recipient who calculates the key using shared secrets and parameters, ensuring the key is never transmitted or stored long-term.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If secret keys are stored on computers for encryption, then data can be encrypted and decrypted, but hackers can access the stored keys to decrypt encrypted data
Solution Approach 1:
The patent extracts the key storage function from the computer system entirely. Instead of storing keys on devices, the system generates random keys for encryption and then deletes them immediately after use. The recipient recalculates the key using mathematical operations with shared parameters, eliminating the need for key storage on any computer.
Solution Approach 2:
The patent performs preliminary key generation and immediate deletion before any potential hacker access can occur. The key is generated, used for encryption, and then destroyed before the system state is saved or transmitted, ensuring no persistent storage vulnerable to hacking remains.
2Reliability
If periodic key changes are implemented to prevent hacker access, then future data security is improved, but the process becomes burdensome and previously compromised data cannot be protected
Solution Approach 1:
The patent uses disposable, single-use random keys that are generated fresh for each encryption operation and immediately deleted afterward. These short-living keys eliminate the need for periodic key rotation procedures while providing security for each individual data encryption event.
Solution Approach 2:
The system performs self-service key management by automatically generating random keys and immediately deleting them without requiring user intervention. The recipient's system automatically recalculates the key using mathematical operations with shared parameters, eliminating manual key exchange and rotation procedures.
3Ease of operation
If encryption keys are transmitted to recipients for decryption, then data can be accessed, but the key may be intercepted by hackers during transmission
Solution Approach 1:
The patent introduces mathematical parameters (such as public keys or shared secrets) as intermediaries that enable key calculation without direct transmission of the actual encryption key. The recipient uses these intermediary parameters combined with their own private values to independently calculate the encryption key, eliminating key transmission over communication channels.
Solution Approach 2:
The patent replaces the mechanical key transmission system with a mathematical calculation system. Instead of transmitting keys through communication channels vulnerable to interception, the system uses mathematical operations with shared parameters to independently derive the same key on both sender and recipient sides.
Data Source
AI summary
An improved method for data encryption has been developed. The method includes storing data, multiple prime numbers and random numbers within an electronic memory storage device. Next, calculating a public number using the multiple prime numbers and providing a public number to a recipient apparatus that has knowledge of the multiple prime numbers. The method then encrypts the stored data with a randomly generated key that is determined with elliptical curve cryptography (ECC) and deletes the randomly generated key after use. Next, the method calculates a common shared secret between the sender and recipient using the prime numbers, a recipient public number and the second random number. The sender and recipient calculate parameters using a key equation based on the randomly generated key and random numbers and a common shared secret. Finally, the recipient calculates the randomly generated key for decryption using the common shared secret, one of the prime numbers, the parameters and the simultaneous equations for decryption of the data.


