Quasi-Cyclic LDPC Coding for Secure Error-Correcting Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure communication methods fail to effectively combine cryptographic encoding and low-density parity check (LDPC) encoding to enhance privacy, as eavesdroppers can exploit error correction capabilities to break encryption.
Innovation Solution
The method involves generating pseudorandom seed values to initialize pseudorandom number generators, creating binary root matrices, and using these to generate quasi-cyclic LDPC codes that intertwine with cryptographic codes, making it difficult for eavesdroppers to perform error correction and cryptanalysis simultaneously.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If cryptographic encoding and LDPC encoding are combined to enhance privacy, then security is improved, but eavesdroppers can exploit error correction capabilities to break encryption
Solution Approach 1:
The patent merges cryptographic encoding and LDPC encoding into a unified hybrid encoding scheme where both functions are performed simultaneously through a single encoding process, making it difficult for eavesdroppers to separate and exploit either function independently
Solution Approach 2:
The encoding process is segmented into distinct cryptographic and error correction components that are interleaved at the bit level, creating a structure where error correction bits are cryptographically protected and cryptographic bits have embedded error correction, preventing attackers from isolating vulnerable components
2Reliability
If error correction capabilities are provided to handle channel errors, then communication reliability is improved, but eavesdroppers can use these capabilities to perform cryptanalysis
Solution Approach 1:
The patent introduces cryptographic encoding as an intermediary layer between the message and error correction encoding, where the cryptographic transformation obscures the structure of the message before error correction is applied, preventing eavesdroppers from using error correction algorithms to recover the original message structure
Solution Approach 2:
Cryptographic encoding is performed as a preliminary action before error correction encoding is applied to the message bits, establishing a secure foundation that protects the message structure from being exploited by subsequent error correction processes performed by eavesdroppers
3Ease of manufacture
If encryption and error correction are separated, then implementation is simplified, but security is compromised as eavesdroppers can exploit error correction
Solution Approach 1:
The patent combines encryption and error correction into a single hybrid encoding process that can be implemented as one unified algorithm, maintaining implementation simplicity while achieving both security and error correction goals simultaneously through integrated processing steps
4Reliability
If cryptographic codes and error correction codes are intertwined, then privacy is enhanced, but device complexity increases
Solution Approach 1:
The patent employs dynamic encoding where the specific encoding parameters and transformations are determined by pseudorandom sequences generated from shared secret keys, allowing the encoding structure to adapt dynamically while maintaining a consistent underlying algorithm that can be efficiently implemented
Solution Approach 2:
The patent changes encoding parameters such as the specific permutation patterns and mixing operations based on the shared secret key, allowing the same basic encoding algorithm to produce different secure encodings for different communication sessions without increasing the fundamental complexity of the encoding mechanism
Data Source
AI summary
A method of transmitting a message includes, for each data block, generating a root matrix using a generator, generating a quasi-cyclic matrix H using the root matrix, encoding the block using H to create a codeword, and transmitting the codeword. The root matrix includes three submatrices: an identity matrix in an upper-left-hand portion of the root matrix, an identity matrix in a lower-left-hand portion of the root matrix, and a circulant matrix in a right-hand portion of the root matrix. The circulant matrix equals the sum of an identity matrix and an identity matrix with rows shifted once to the right. Generating H includes expanding the root matrix by replacing 0 elements in the root matrix by a square matrix of 0 elements and replacing 1 elements in the root matrix by a shifted diagonal matrix. Non-zero elements of the diagonal matrix are selected from GF(q) based on the generator.


