Nibble-Histogram Compression to Append MACs Without Message Expansion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing compression techniques are not effectively applicable to security-oriented compression due to their design for larger entities and elaborate dictionaries, leading to inefficiencies in storing and transmitting small-sized security metadata without message expansion, and the adoption of alternative methods like implicit integrity is slow to gain industry acceptance.
Innovation Solution
The proposed solution involves identifying patterns in small-sized data units such as nibbles, bytes, and words to compress security metadata, using minimal dictionaries and encoding schemes that free up space for appending security metadata like MACs or ICVs without message expansion, employing methods like byte-equality, adjacent byte-equality, and nibble-histogram-based compression.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If existing compression techniques are used for security metadata, then compression ratio is improved, but message expansion occurs and security metadata cannot be appended
Solution Approach 1:
The patent changes the compression target from maximizing compression ratio to achieving specific compression levels that free up predetermined numbers of bits (e.g., 8, 16, 24, 32 bits). This parameter change allows the compression algorithm to stop at points that accommodate security metadata requirements without causing message expansion.
Solution Approach 2:
The patent performs compression as a preliminary action before appending security metadata. By compressing the data first and then appending the security tags to the compressed output, the system ensures that the total size remains within the original message size limit while still providing security protection.
2Loss of substance
If compression algorithms are designed for larger entities with elaborate dictionaries, then compression effectiveness is improved, but computational overhead and hardware cost increase
Solution Approach 1:
The patent extracts and applies only the essential compression operations needed for small security metadata, removing the elaborate dictionary structures and complex processing designed for larger entities. This extraction maintains sufficient compression effectiveness while dramatically reducing computational overhead and hardware cost.
Solution Approach 2:
The patent employs simplified, lightweight compression structures that are computationally inexpensive and suitable for single-use or short-term processing of small data units, rather than maintaining complex permanent dictionary structures. This approach reduces hardware cost and computational overhead while achieving the necessary compression for security metadata.
3Reliability
If alternative methods like implicit integrity are adopted, then security metadata storage is improved, but industry acceptance is slow
Solution Approach 1:
The patent creates a universal solution that combines compression with security metadata appending, making it applicable across multiple platforms and systems. By demonstrating versatility in handling different data types and sizes while maintaining security, the solution gains broader industry acceptance compared to specialized alternatives like implicit integrity.
Data Source
AI summary
A method of data nibble-histogram compression can include determining a first amount of space freed by compressing the input data using a first compression technique, determining a second amount of space freed by compressing the input data using a second, different compression technique, compressing the input data using the compression technique of the first and second compression techniques determined to free up more space to create compressed input data, and inserting into the compressed input data, security data including one of a message authentication control (MAC) and an inventory control tag (ICT).


