TRNG Disk Encryption for Quantum-Resistant Data Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current cryptographic systems for securing data are vulnerable to quantum computing, hardware flaws, and side-channel attacks, particularly due to the use of small encryption keys and unproven assumptions in public key cryptography, which can lead to exposure of sensitive data during transit and storage.
Innovation Solution
A method and system utilizing a true random number generator (TRNG) disk with a universally unique identifier (UUID) to encrypt data with dynamically generated, long encryption keys that are stored separately, ensuring that only the presence of multiple TRNG disk copies can decrypt the data, thereby providing a cryptographically unbreakable and secure data transport and storage solution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If standard encryption algorithms (AES-GCM, Curve25519) are used with 256-bit keys, then data security is maintained under current computing conditions, but security becomes vulnerable to quantum computing attacks and hardware side-channel attacks
Solution Approach 1:
The patent changes the fundamental parameter of encryption from fixed-length keys (256-bit) to variable-length random bit sequences that match the data size. This transforms the encryption approach from key-based to data-size-based randomization, making quantum attacks ineffective since there is no repeating key pattern for quantum algorithms to exploit.
Solution Approach 2:
The patent segments the encryption process by dividing data into blocks and applying independent random bits to each block rather than using a single master key. This segmentation ensures that even if one segment is compromised, the rest remain secure, and it prevents quantum computers from using quantum parallelism to break the encryption efficiently.
2Reliability
If One Time Pad encryption is used with random keys of the same length as the message, then mathematically provable security is achieved, but key storage and distribution becomes prohibitive
Solution Approach 1:
The patent creates multiple copies of the random bit sequences and distributes them alongside the encrypted data. Instead of requiring the recipient to receive and store the entire key, the system copies the random bits in a distributed manner across multiple storage locations, making the system more resilient to loss and easier to manage while maintaining OTP security.
Solution Approach 2:
The patent adds a temporal dimension to key management by generating new random bits for each data block as it is processed, rather than requiring pre-shared static keys. This transforms the key distribution problem from a spatial challenge to a temporal one, where keys are generated on-demand and discarded afterward, eliminating the need for long-term key storage.
3Productivity
If small encryption keys (256 bits) are used, then encryption performance is efficient, but the keys can be easily transmitted and used to decrypt massive amounts of secured data
Solution Approach 1:
The patent makes the encryption keys dynamic by generating new random bit sequences for each data block rather than using static master keys. This dynamic key generation ensures that the encryption remains efficient for each individual block while providing strong security overall, as the keys change with each encryption operation and cannot be reused to decrypt multiple datasets.
4Speed
If physical storage devices are used for large data transfers, then transfer speed increases significantly, but the devices may be stolen or corrupted during transport and storage
Solution Approach 1:
The patent segments the data into smaller blocks that can be encrypted and transmitted independently, reducing the amount of data that needs to be physically transported at once. This segmentation allows for faster transfer rates while minimizing the risk of theft or corruption, as smaller encrypted blocks are harder to steal intact and can be processed more quickly.
Data Source
AI summary
Securing data using random bits uses a TRNG disk with a plurality of random bits and a universally unique identifier (UUID). At least one TRNG disk copy is created, which is identical to the TRNG disk. The TRNG disk copy is stored in a separate physical location than the TRNG disk. Source data is received and encrypted with a block of random bits of the TRNG disk to produce encrypted data. The block of random bits of the TRNG disk has a bit offset which is a positional address of the block of random bits within the TRNG disk. The encrypted source data, the UUID, and the bit offset of the TRNG disk are communicated from a first location to at least a second location. The encrypted source data is decrypted at the second location using the UUID, the offset of the TRNG disk, and the TRNG disk copy.