Non-Volatile Memory Encryption Using One-Time Keys and XOR Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encryption methods for data stored in memory areas are energy-intensive and time-consuming, and one-time pads, while more efficient, are not suitable for non-volatile memories due to security concerns when reused.
Innovation Solution
A method using a one-time key, such as a one-time pad, is applied in conjunction with a key identification that is uniquely determined for each memory area, ensuring that the same key is not reused, and a buffer memory is used to store key identifications for efficient access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If cryptographic arithmetic unit is used for encryption, then security of encrypted data is improved, but energy consumption increases considerably
Solution Approach 1:
The encryption system is segmented into two parts: a secure key management component that stores the one-time key in a protected memory area, and an encryption component that uses XOR operations. This segmentation allows the computationally intensive key generation to be performed once securely, while subsequent encryption operations are energy-efficient.
Solution Approach 2:
A one-time key serves as an intermediary between the secret key and the data to be encrypted. The one-time key is generated using a key derivation function that takes the secret key and a unique identifier as inputs, enabling efficient XOR-based encryption without directly using the secret key for each encryption operation.
2Reliability
If cryptographic arithmetic unit is used for encryption, then security of encrypted data is improved, but encryption time increases
Solution Approach 1:
Instead of performing complex cryptographic operations on the original data, the system creates a one-time key that acts as a copy or representation of the encryption material. This one-time key can be XORed with the data in parallel, significantly reducing encryption time while maintaining security through the properties of the underlying cryptographic functions.
Solution Approach 2:
The one-time key is generated in advance using a key derivation function before the actual encryption process. This preliminary action separates the computationally intensive key generation from the data encryption step, allowing the encryption itself to be performed quickly using simple XOR operations.
3Use of energy by moving object
If one-time pad is used for encryption, then energy consumption is reduced and processing speed is improved, but security is compromised when key is reused
Solution Approach 1:
The system changes the parameter of the one-time key by incorporating a unique identifier (such as a memory address or data identifier) into the key derivation process. This ensures that even though the same secret key is used, the resulting one-time keys are different for each encryption operation, maintaining the security property of one-time pads while enabling repeated use.
Solution Approach 2:
The one-time key generation process is made dynamic by incorporating variables such as unique identifiers or counters into the key derivation function. This dynamic approach ensures that the effective key changes with each encryption operation while maintaining the efficiency benefits of XOR-based encryption.
4Productivity
If one-time pad is used for encryption, then processing can be parallelized efficiently, but key management becomes complex for non-volatile memories
Solution Approach 1:
The system applies local quality by associating a unique identifier with each specific memory area or data set. This allows the one-time key to be locally customized for each encryption target using the formula: one-time key = KDF(secret key, unique identifier), simplifying key management while enabling parallel processing of multiple data sets.
Data Source
AI summary
A method for encrypting data stored in a memory area is proposed, wherein the data are encrypted on the basis of a key identification for the data and on the basis of a one-time key.
