Nonce Verification Using Masked Sub-Bloom Filters
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Cryptosystems face issues with ensuring sufficient randomness and tracking of nonces when random values are reused due to potential duplication, leading to security vulnerabilities.
Innovation Solution
A security device utilizing a combination of masks and sub-bloom filters to verify the uniqueness of nonces by generating hash values from input data, allowing efficient duplication detection using a common hash function across multiple sub-bloom filters.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple bloom filters are used to track nonces, then the reliability of duplication detection is improved, but the device complexity increases
Solution Approach 1:
The patent divides a single large bloom filter into multiple smaller sub-bloom filters. Each sub-bloom filter handles a portion of the nonce tracking task, and they work together to provide comprehensive duplication detection. This segmentation reduces the complexity of managing a single large filter while maintaining the reliability of nonce tracking across the entire system.
2Measurement precision
If multiple hash functions are used in each bloom filter, then the measurement precision of duplication detection is improved, but the productivity of nonce verification decreases
Solution Approach 1:
The patent segments the hash function workload by assigning only one hash function to each sub-bloom filter. This distribution of hash functions across multiple filters reduces the computational burden on any single filter, thereby improving verification speed while maintaining detection accuracy through the collective operation of all sub-filters.
Solution Approach 2:
The patent combines multiple sub-bloom filters into a unified verification system where each sub-filter contributes to the overall duplication detection. By merging the results from multiple sub-filters, the system achieves high detection accuracy without requiring each individual sub-filter to perform multiple hash operations, thus maintaining productivity.
3Device complexity
If a single bloom filter is used, then the device complexity is reduced, but the likelihood of false positives increases
Solution Approach 1:
The patent divides a single bloom filter into multiple sub-bloom filters, each maintaining its own bit array and hash function. This segmentation reduces the false positive rate because the probability of all sub-filters simultaneously producing false positives for the same nonce is significantly lower than a single large filter, while the overall structure remains relatively simple and manageable.
Data Source
AI summary
Disclosed is a security device which includes a memory and a processor connected with the memory to execute at least one instruction. The processor is configured to execute the at least one instruction to cause the security device to generate a plurality of pieces of combination data by combing input data and a plurality of masks, each of which is uniquely assigned to one of a plurality of sub-bloom filters, obtaining a plurality of hash values, based on inputting the plurality of pieces of combination data into one hash function common to the plurality of sub-bloom filters, and determining whether the input data is duplicated based on the plurality of hash values.