Address-Rotated Checksum for Detecting Data Reordering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional checksum algorithms fail to effectively detect data reordering and require significant computational resources, making them inefficient for protecting large data blocks against corruption and modifications.
Innovation Solution
A checksum system that incorporates address information for each data unit, using a hash function to rotate the data units before applying an XOR operation, thereby detecting reordering and modifications while being computationally efficient.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional checksum algorithms are used, then computational overhead is reduced, but the ability to detect data reordering is lost
Solution Approach 1:
The data is divided into individual data units (bytes or words), and each unit is processed separately with its own address information. This segmentation allows the checksum to track individual units through the data structure, enabling detection of reordering while keeping the computational complexity manageable through systematic processing of discrete elements.
Solution Approach 2:
The patent adds an address dimension to the traditional checksum calculation. Instead of merely XORing data values, the system incorporates the address or offset of each data unit into the checksum computation. This additional dimensional information enables the detection of reordering operations while maintaining computational efficiency through structured address-based processing.
2Reliability
If address information is incorporated for each data unit, then detection of reordering is improved, but computational overhead increases
Solution Approach 1:
The patent transforms the checksum computation by changing the parameters being processed - instead of only data values, the system processes both data values and their address information. The address parameters are rotated based on position and incorporated into the checksum, providing enhanced modification detection while maintaining acceptable processing speeds through efficient parameter transformation.
3Productivity
If simple XOR checksum is used, then processing efficiency is maintained, but detection capability against reordering is insufficient
Solution Approach 1:
The patent applies preliminary rotation operations to each data unit based on its address information before the final XOR accumulation. This preliminary action of rotating data units by their address positions embeds positional information into the data itself, so that subsequent XOR operations naturally detect reordering without requiring additional complex processing during verification.
Data Source
AI summary
Generating data checksum for a data object including multiple data units comprises, for each data unit, obtaining a corresponding address of the data unit, and rotating the data unit based on said corresponding address of the data unit to generate a rotated data unit. A checksum value for the data object is determined based on said rotated data units.