Collision-Free Hashing for Cryptographic Metadata Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic computing systems face challenges in efficiently accessing and managing cryptographic metadata due to high collision rates in hash tables, which leads to increased memory usage and access overhead, especially when tables are accessed using large index values.
Innovation Solution
The implementation of collision-free hashing techniques 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 cryptographic metadata without invoking collision handling mechanisms, and enabling high table occupancy rates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional hash tables are used to store cryptographic metadata, then memory usage increases due to collisions, but using collision handling mechanisms increases access overhead and time
Solution Approach 1:
The patent changes the parameters of the hash function itself by combining multiple cryptographic hash functions (SHA-1, SHA-256, MD5) with different bit-level operations (reordering, substitutions, additions with carries) to create a composite hash function that produces unique indices without collisions, thereby eliminating the need for collision handling mechanisms and reducing access overhead while maintaining efficient memory usage
Solution Approach 2:
The patent creates a composite hash function by combining multiple different hash functions (SHA-1, SHA-256, MD5) with various bit-level transformations into a single unified hashing mechanism. This composite approach leverages the strengths of each individual hash function to achieve collision-free indexing, resolving the contradiction between memory efficiency and access speed
2Quantity of substance
If hash tables operate at high capacity, then memory utilization improves, but collision rates increase leading to more memory accesses
Solution Approach 1:
The patent modifies the hash function parameters by using a composite of multiple cryptographic hash functions with varied bit-level operations, which ensures that even at high table occupancy rates, each metadata entry maps to a unique index without collisions. This maintains both high memory utilization and processing efficiency by eliminating the performance degradation that would normally result from collisions
3Reliability
If cryptographic mechanisms are applied to protect data, then security is improved, but access to metadata becomes more complex
Solution Approach 1:
The patent creates a universal composite hash function that simultaneously provides cryptographic security through multiple hash algorithms and simplifies metadata access by producing collision-free indices directly. This multi-functional approach integrates security and efficiency into a single mechanism, reducing access complexity while maintaining strong cryptographic protection
Data Source
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.