Bit-Mixer Hash Functions for Secure Low-Power Authentication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current hash and message authentication code (MAC) functions are inflexible, power-consuming, slow, and vulnerable to side channel attacks, failing to meet the security and performance requirements of applications like commercial and military aviation where high security and low power consumption are critical.
Innovation Solution
A computer-implemented method and system using bit-mixing operations to produce message authentication tags, involving segmentation of messages into blocks, bit-mixing with initialization values, and exclusive OR operations with encrypted null counters, implemented using constructions like double-mix Feistel networks or substitution-permutation networks to achieve secure and efficient hash/MAC functions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If current hash and MAC functions are used, then security requirements are met, but speed and power consumption are poor
Solution Approach 1:
The message is segmented into fixed-size blocks that are processed independently through the bit-mixer function. This segmentation allows for parallel processing of multiple blocks simultaneously, significantly improving computation speed while maintaining security properties. The block-based approach enables hardware implementations to efficiently pipeline operations and reduce overall processing time and power consumption.
Solution Approach 2:
The patent replaces traditional cryptographic hash/MAC mechanisms with a bit-mixer based system that uses simpler logical operations (XOR, AND, NOT) instead of complex mathematical computations. This substitution of computational mechanics dramatically reduces processing time and power consumption while maintaining cryptographic security through the properties of the bit-mixer function and its resistance to differential and linear cryptanalysis.
2Productivity
If current hash and MAC functions are used, then security is provided, but they are slow and consume a lot of power
Solution Approach 1:
By dividing the input message into fixed-size blocks and processing each block through the bit-mixer independently, the system achieves high computational efficiency. The segmented approach allows for parallel execution of multiple blocks, reducing total computation time and improving productivity without sacrificing security.
Solution Approach 2:
The patent employs variable parameters including different block sizes, number of rounds, and key lengths to optimize computation efficiency for different applications. By adjusting these parameters, the system can achieve higher productivity when security requirements are met, while minimizing computation time and resource usage.
3Adaptability or versatility
If current hash and MAC functions are used, then fixed security levels are provided, but flexibility is limited
Solution Approach 1:
The bit-mixer function incorporates dynamic parameters such as variable round counts, adjustable block sizes, and configurable key lengths that can be changed based on security requirements. This dynamic adaptability allows the same hardware or software implementation to provide multiple security levels without requiring separate systems, enhancing versatility while managing complexity through a unified architecture.
Solution Approach 2:
The bit-mixer based hash/MAC system serves multiple functions including data integrity verification, authentication, and encryption mode operation. The universal design allows a single implementation to provide various security levels and applications, from low-power embedded systems to high-security applications, reducing overall device complexity by eliminating the need for multiple specialized functions.
4Reliability
If current hash and MAC functions are used, then security is provided, but they are vulnerable to side channel attacks
Solution Approach 1:
The patent converts the potential vulnerability of simple logical operations into a security advantage by carefully designing the bit-mixer to be resistant to side-channel analysis. The use of XOR, AND, and NOT operations with properly randomized timing and data-dependent operations transforms what could be simple, attackable logic into a robust security mechanism that resists power analysis, timing attacks, and other side-channel threats while maintaining operational reliability.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Provided is a method and system for producing message authentication tags and a method and system for producing hash values using bit-mixers. The methods include producing a message authentication or hash value by obtaining a message; segmenting, padding by an electronic processor, the message into a number of equal sized message blocks comprising a first message block, one or more subsequent message blocks, and a final message block; performing, by the electronic processor, a first bit-mixing operation on the first message block with an initialization value; performing, by the electronic processor, subsequent bit-mixing operations on the one or more subsequent message blocks and the final message block with a previous message block; and producing, by the electronic processor, the message authentication tag based on the first bit-mixing operation and the subsequent bit-mixing operations, employing a secret key material.