Hashed Index Tag Memory for Key Lookup Speed
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing memory storage systems face inefficiencies due to the need for large numbers of encryption keys, leading to increased memory allocation, cost, and power consumption, as well as slower data access speeds.
Innovation Solution
The proposed solution involves using a KPIO system that employs a hashed index as a tag address to improve lookup speed by reducing the reliance on slower secondary memory and minimizing the number of lookup iterations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a large number of encryption keys are allocated in memory storage systems, then data security is improved, but memory allocation increases, cost increases, and power consumption increases
Solution Approach 1:
The patent segments the key storage system into multiple levels: a small, fast primary memory (e.g., SRAM) that stores only the most frequently accessed keys, and a larger, slower secondary memory (e.g., NAND flash) that stores the complete key set. This segmentation allows the system to maintain high security by having all keys available while reducing the amount of expensive, power-hungry primary memory needed.
Solution Approach 2:
The system performs preliminary actions by pre-loading only the frequently accessed keys into primary memory before they are actually needed. This allows the system to have immediate access to commonly used keys without requiring all keys to be present in fast memory, thereby reducing memory allocation while maintaining security for frequent operations.
2Reliability
If a large number of encryption keys are allocated in memory storage systems, then data security is improved, but cost increases
Solution Approach 1:
The patent segments the key storage system into multiple levels: a small, fast primary memory (e.g., SRAM) that stores only the most frequently accessed keys, and a larger, slower secondary memory (e.g., NAND flash) that stores the complete key set. This segmentation allows the system to maintain high security by having all keys available while reducing the amount of expensive, power-hungry primary memory needed.
Solution Approach 2:
The system dynamically changes the parameter of key distribution by using a hash function to determine which keys are loaded into primary memory based on access patterns. This allows the system to adapt to different security requirements and access scenarios, optimizing the balance between security and cost by loading only necessary keys into expensive memory.
3Reliability
If a large number of encryption keys are allocated in memory storage systems, then data security is improved, but power consumption increases
Solution Approach 1:
The patent segments the key storage system into multiple levels: a small, fast primary memory (e.g., SRAM) that stores only the most frequently accessed keys, and a larger, slower secondary memory (e.g., NAND flash) that stores the complete key set. This segmentation allows the system to maintain high security by having all keys available while reducing the amount of expensive, power-hungry primary memory needed.
Solution Approach 2:
The system implements periodic action by using a hash function to dynamically determine which keys should be loaded into primary memory based on periodic analysis of access patterns. This allows the system to maintain security while minimizing power consumption by loading only the necessary subset of keys into the power-hungry primary memory at any given time.
4Device complexity
If traditional memory access methods are used, then system simplicity is maintained, but data access speed decreases
Solution Approach 1:
The system performs preliminary actions by pre-loading only the frequently accessed keys into primary memory before they are actually needed. This allows the system to have immediate access to commonly used keys without requiring all keys to be present in fast memory, thereby reducing memory allocation while maintaining security for frequent operations.
Solution Approach 2:
The patent introduces a hash function as an intermediary that maps data to the appropriate key in primary memory. This intermediary enables fast access by computing the hash of the data and directly retrieving the corresponding key from primary memory, avoiding the need to search through all keys in secondary memory and significantly improving data access speed.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method of a memory device is provided. The method includes identifying (1201) a tag address of a tag memory based, at least partially, on a source index; accessing (1202) a cache storage address corresponding to the tag address; comparing (1203) tag memory content and at least part of the source index to identify whether a match exists or whether a conflict exists; and in response to identifying whether the match exists or whether the conflict exists, obtaining (1204) information from the cache storage address.