Error-Correction Encoding With Random Vector Masking

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional error-correcting codes lack security measures against wiretapping during data transmission, making it easy for third parties to intercept and estimate the original data.

Innovation Solution

An encoding method that generates a random vector and concatenates it with the original data before applying [n, m] encoding, ensuring that the output codewords include patterns that obscure the original data, and optionally uses a two-step encoding process to simplify the encoding procedure while maintaining security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional error-correcting codes are used, then error correction capability is provided, but security against wiretapping is insufficient

Engineering Contradiction:
Improveerror correction capabilityVSAvoidsecurity vulnerability to wiretapping
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The original data is divided into information bits and parity bits through systematic encoding. The parity bits are generated by multiplying the information bits with a generator matrix, creating segmented code words that provide both error correction capability and security through the mathematical structure of the code

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

A random vector is introduced as an intermediary element between the original data and the encoded output. This random vector is XORed with the systematic code words to produce the final transmitted signal, acting as a masking layer that prevents direct observation of the original data while maintaining error correction functionality

Inventive Principle:
Principle #24Intermediary (Mediator)

2Object-affected harmful factors

If random vectors are generated and concatenated with original data before encoding, then security against eavesdropping is improved, but encoding complexity increases

Engineering Contradiction:
Improveeavesdropping resistanceVSAvoidencoding procedure complexity
Core Design Contradiction:
Object-affected harmful factorsVSDevice complexity

Solution Approach 1:

The security enhancement mechanism is merged with the existing error correction encoding process. The random vector generation and XOR operation are integrated into the encoding pipeline, allowing security to be added without requiring a completely separate encoding system, thus limiting the increase in complexity

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The encoding process utilizes parameter changes by modifying the code words through XOR operation with random vectors. This parameter transformation approach maintains the mathematical structure needed for error correction while changing the observable parameters to provide security, achieving security through controlled parameter modification rather than complex procedural changes

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS8176393B2Encoding device for error correction, encoding method for error correction and encoding program for error correction
Publication Date: 2012.05.08 TAMAGAWA ACADEMY & UNIV
  • US8176393B2 patent drawing
  • US8176393B2 patent drawing
  • US8176393B2 patent drawing

AI summary

The present invention aims at providing an encoding device for error correction, encoding method for error correction and encoding program for error correction wherein countermeasures against eavesdropping are taken into account. To achieve this, in accordance with an aspect of the present invention there is provided an encoding device for error correction, the device comprises a generation means for generating randomly a vector u=(xk+1, . . . , xm) composed of m-k digit(s); a creation means for creating an x′=[xu]=(x1, . . . , xm) by concatenating the vector u=(xk+1, . . . , xm) composed of m-k digit(s) randomly created by the creation means to data x=(x1, . . . , xk) to send; and an output means for outputting a vector of length n by carrying out [n, m] encoding of the x′ created by the creation means.