Collision-Free Hashing for Cryptographic Metadata Cache Expansion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing hash table implementations for accessing cryptographic computing metadata face challenges in minimizing collisions, leading to high memory usage and complex collision handling mechanisms, which are difficult to realize in hardware and inefficient for high-capacity operations.
Innovation Solution
The implementation of collision-free hashing using a plurality of cryptographically-strong hash functions that combine additions with carries, bit-level reordering, and wide substitutions, allowing for efficient storage and access of security metadata without invoking collision handling mechanisms, and supporting high table occupancy rates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hash table implementations are used for accessing cryptographic computing metadata, then collision handling mechanisms can be implemented, but device complexity increases and hardware realization becomes difficult
Solution Approach 1:
The patent extracts and eliminates the collision handling mechanism from the hash table implementation by using cryptographic hash functions with sufficient output width to prevent collisions entirely. This removes the complex collision resolution hardware while maintaining reliable metadata access.
Solution Approach 2:
The patent uses wide substitution layers in the hash function that can be implemented with simple, disposable-like hardware components rather than complex reusable collision handling mechanisms. Each hash function instance is self-contained and doesn't require additional collision resolution infrastructure.
2Ease of operation
If collision handling mechanisms are implemented in hash tables, then collision resolution is possible, but the mechanism is difficult to realize in hardware
Solution Approach 1:
The patent removes the collision handling subsystem entirely by designing hash functions with sufficient output width and using multiple hash functions to achieve collision-free operation, making hardware implementation straightforward without complex collision resolution logic.
Solution Approach 2:
The patent changes the parameter of hash function output width to be sufficiently large (using wide substitutions) to prevent collisions, and uses multiple parallel hash functions, transforming the problem from collision handling to collision prevention through parameter optimization.
3Quantity of substance
If high table occupancy rates are achieved, then memory utilization improves, but collision probability increases in traditional hash tables
Solution Approach 1:
The patent changes the parameter of hash function strength and output width by implementing multiple cryptographic hash functions with wide substitution layers, enabling the system to maintain high table occupancy rates while keeping collision probability negligible through superior hashing capability.
Solution Approach 2:
The patent combines multiple cryptographic hash functions with different transformation layers (addition with carries, bit-level reordering, wide substitutions) to create a composite hashing system that achieves both high occupancy and low collision probability, analogous to using composite materials for enhanced properties.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Embodiments are directed to collision-free hashing for accessing cryptographic computing metadata and for cache expansion. An embodiment of an apparatus includes one or more processors to compute a plurality of hash functions that combine additions, bit-level reordering, bit-linear mixing, and wide substitutions, wherein each of the plurality of hash functions differs in one of the additions, the bit-level reordering, the wide substitutions, or the bit-linear mixing; and access a hash table utilizing results of the plurality of hash functions.