ECC Message Authentication Using Pseudorandom Transposition
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing message authentication methods for error-correcting codes require additional storage, degrading storage capability, and do not provide sufficient security, as seen in naive applications of message authentication codes (MAC) and modified Bose-Chaudhuri-Hoquenghem (BCH) codes with MAC properties.
Innovation Solution
A storage-free message authentication system that uses a pseudorandom transposition of characters and a random pad, combined using an XOR operation, to generate an encoded message, which is then decoded using a secret key, without requiring additional storage, employing error-correcting codes like BCH and Reed-Solomon codes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a naive application of message authentication code (MAC) is used for message authentication, then security is improved, but storage capability deteriorates due to additional bits required
Solution Approach 1:
The patent combines message authentication functionality with error-correcting code functionality into a unified encoding scheme. The secret key is integrated into the ECC encoding process itself, allowing the parity code to serve dual purposes: error correction and message authentication, thereby eliminating the need for separate MAC bits and preserving storage capability
Solution Approach 2:
The error-correcting code is designed to perform multiple functions simultaneously: it provides error detection, error correction, and message authentication all through the same encoded message structure. The secret key enables the parity code to authenticate messages while maintaining the original storage efficiency of the ECC scheme
2Quantity of substance
If a modified Bose-Chaudhuri-Hoquenghem (BCH) ECC with MAC properties is used, then storage capability is maintained, but security is insufficient
Solution Approach 1:
The patent modifies the BCH ECC parameters and structure by incorporating a secret key into the encoding process. This changes the mathematical properties of the code to provide stronger security guarantees while maintaining the same storage efficiency. The secret key transforms the standard BCH code into a secure authenticated encoding scheme without adding overhead bits
Data Source
AI summary
Techniques for storage-free message authentication for error-correcting-codes are disclosed. A storage controller of a storage device receives a request to encode a message in a format having an error-correcting code schema that generates a parity code. A key generator generates a pseudorandom transposition of the message and the parity code as a first part of a secret key. A pseudorandom character string is determined as a second part of the secret key. The output of the pseudorandom transposition and the pseudorandom character string are combined to generate the encoded message which is returned in response to the request. The secret key associated with the message is stored in non-volatile memory.