Parallel Hash Authentication Using Checkpoint Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing hash function authentication methods for large data strings, such as program codes on electronic gaming machines, are time-consuming and inefficient, requiring sequential processing of data string pieces, which increases the time to initialize the machines and does not allow pinpointing of unauthorized modifications.
Innovation Solution
The implementation of authentication checkpoint hashes enables parallel processing of hash functions by storing and using checkpoint hashes to simultaneously authenticate multiple sets of data string pieces, reducing the authentication time and allowing for quicker execution of program codes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If sequential processing of data string pieces is used for hash function authentication, then authentication accuracy is maintained, but authentication time increases significantly
Solution Approach 1:
The patent divides the data string into multiple pieces and introduces checkpoint hashes at intermediate positions. Each checkpoint hash serves as a verification point that allows the system to validate multiple segments in parallel while maintaining the integrity of the sequential hash chain. This segmentation enables parallel processing of independent segments without compromising authentication accuracy.
Solution Approach 2:
The patent pre-calculates and stores checkpoint hashes at predetermined positions within the data string during the initial authentication phase. These pre-computed checkpoint hashes serve as reference points that enable subsequent parallel verification processes. By performing this preliminary action, the system prepares verification anchors that can be used to validate multiple segments simultaneously, reducing authentication time while maintaining accuracy.
2Reliability
If sequential processing of data string pieces is used, then hash function security is maintained, but machine initialization time increases
Solution Approach 1:
The patent segments the data string into multiple pieces with checkpoint hashes positioned at intermediate points. This segmentation allows the initialization process to verify multiple segments in parallel rather than sequentially, significantly reducing machine initialization time while preserving the security properties of the hash function through the checkpoint verification mechanism.
Solution Approach 2:
The system performs preliminary computation of checkpoint hashes during data string preparation or initial authentication. These pre-computed checkpoints enable faster subsequent initializations by providing ready-to-use verification points that allow parallel processing of data segments, thereby improving machine initialization speed without compromising security.
3Reliability
If traditional hash authentication is used, then unauthorized modifications can be detected, but the process is too slow for practical use
Solution Approach 1:
The patent introduces checkpoint hashes at intermediate positions within the data string, creating multiple verification points. This segmentation enables the authentication process to validate multiple segments in parallel while maintaining the ability to detect unauthorized modifications. The checkpoint hashes serve as anchors that allow the system to verify integrity across different segments simultaneously, reducing authentication time while preserving detection capability.
Solution Approach 2:
The system pre-computes checkpoint hashes and stores them alongside the data string or in a separate verification structure. These pre-computed checkpoints enable rapid parallel verification during authentication, allowing the system to quickly detect unauthorized modifications without the time penalty of sequential processing, thus making the authentication process practical for real-time use.
Data Source
AI summary
Systems and methods enabling parallel processing of hash functions are provided. A data string including a plurality of pieces arranged in an order is hashed using a hash function to determine a plurality of authentication checkpoint hashes associated with the pieces. To authenticate the data string, the pieces are grouped into sets, and the authentication checkpoint hash associated with the piece following all other pieces of that set in the order is associated with that set. The system simultaneously performs a separate hash process on each set. That is, the system hashes the pieces of that set using the hash function to determine a result hash, and compares that result hash with the authentication checkpoint hash associated with that set. The initial input to the hash function for the hash process for each set includes one of the pieces and either a default seed or an authentication checkpoint hash.