Hash Table String Segmentation for Secure Data Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computer-based technologies are inefficient and impractical for matching smaller string segments in large datasets due to exponential increases in comparison numbers, making brute-force approaches impractical for secure data transmission.
Innovation Solution
The use of efficient hash tables to automatically detect and remove protected information from data packages by iteratively processing string segments, reducing computational resources and enhancing network security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If brute-force scanning and comparisons are used to detect information in strings, then information matching can be performed, but the number of comparisons increases exponentially as information size increases, making the approach impractical
Solution Approach 1:
The patent segments the information to be transmitted into smaller string segments or substrings. Instead of comparing the entire large dataset against the information, the system divides the information into manageable segments that can be efficiently searched and matched within the larger dataset, reducing the exponential complexity of brute-force comparison.
Solution Approach 2:
The patent introduces hash tables as an intermediary data structure to facilitate efficient matching. By converting information segments into hash values and storing them in hash tables, the system enables constant-time or near-constant-time lookup operations, replacing the exponential brute-force comparison approach with efficient intermediary-based searching.
2Quantity of substance
If the information to be transmitted increases in size, then more comprehensive data can be shared, but the number of comparisons required increases exponentially, consuming more computational resources
Solution Approach 1:
The patent segments both the information to be transmitted and the target dataset into smaller units. By dividing large information blocks into smaller segments and creating corresponding segments in the dataset, the system reduces the computational burden of comparing large volumes of data, enabling efficient processing even as data transmission volume increases.
Solution Approach 2:
The patent performs preliminary processing by creating hash tables from segments of the information before the actual matching process. This preliminary action of pre-computing hash values and organizing them in efficient data structures reduces the computational resources needed during the actual data transmission and matching operations.
3Reliability
If brute-force approaches are used for secure data transmission, then all data can be transmitted, but the computational resources required to protect secure data increase exponentially
Solution Approach 1:
The patent segments the data transmission process into controlled steps involving segment creation, hashing, and systematic matching. This segmentation allows for implementing security checks at multiple points in the process while maintaining manageable system complexity, as each segment can be processed independently through the established hashing and matching framework.
Solution Approach 2:
The patent uses hash tables as intermediaries to manage the complexity of secure data matching. The hash table structure provides a systematic and efficient mechanism for verifying data segments without requiring complex brute-force comparison algorithms, thereby maintaining security while reducing overall system complexity.
Data Source
AI summary
Systems and methods for removing data from strings are disclosed. A system can access a first hash table that stores representations of a first set of strings, where the representations have predetermined number of characters. The system can generate a second hash table that stores a second representations of a string of a second set of strings, where the second representations have the predetermined number of characters. Upon determining that the first hash table includes at least one of the plurality of second representations of the string included in the second hash table, the system can increment a counter associated with the string. The system can generate a third set of strings by removing the string from the second set of strings responsive to determining that the counter satisfies a threshold, and transmit the third set of strings to a computing system.