HB+ Authentication Protocol Using Binary Matrices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The HB+ authentication protocol for low-cost RFID microchips is vulnerable to attacks that modify challenge bits to deduce secret keys and suffers from high false alarm rates and excessive communication complexity, making it impractical for real-world applications.
Innovation Solution
A method using n×m binary matrices as secret keys, where the entity to be authenticated and the verification entity exchange binary vectors and a noise vector, calculating a response vector and accepting authentication based on the Hamming weight of error vectors, which reduces the number of iterations and communication bits, enhancing resistance to attacks and reducing false alarms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If the HB+ authentication protocol is used with binary vectors and noise bits, then the authentication can be performed with simple calculations suitable for low-cost microchips, but the protocol becomes vulnerable to attacks that modify challenge bits to deduce secret keys
Solution Approach 1:
The patent transitions from using simple binary vectors (1D) to using binary matrices (2D structure). The secret keys are now n×m binary matrices instead of binary vectors, and the response is an m-bit vector instead of a single bit. This dimensional change increases the complexity of attacks while maintaining computational simplicity for legitimate authentication, as the matrix structure provides additional security layers against bit-modification attacks.
2Reliability
If the HB+ protocol uses a large number of iterations to reduce false alarm rates, then the authentication reliability improves, but the communication complexity and time consumption increase excessively
Solution Approach 1:
The patent changes the fundamental parameters of the authentication protocol: instead of using a single noise bit, it uses an m-bit noise vector where each bit is independently set with probability η. The response becomes an m-bit vector derived from matrix operations. This parameter change allows achieving lower false alarm rates with fewer iterations, reducing communication complexity from O(r·(2n+1)) to O(r·(2n+m)) bits where m < n typically.
3Ease of manufacture
If the HB+ protocol uses a single noise bit in the response, then the calculation remains simple for low-cost microchips, but the protocol suffers from high false alarm rates requiring many iterations
Solution Approach 1:
The patent merges multiple authentication checks into a single response vector of m bits. Instead of performing r iterations with single-bit responses, the system performs matrix operations that produce an m-bit response vector, effectively combining the security of multiple checks while reducing the number of iterations needed. This merging approach maintains calculation simplicity while significantly reducing false alarm rates.
Data Source
AI summary
A method of authenticating an entity by a verification entity, said entities sharing a pair of secret keys X and Y which are n×m (n, m>i) binary matrices. The method may be applied to cryptographic protocols for authenticating electronic chips at a very low cost.