Chaotic Encryption for OFDM Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing OFDM communication systems lack inherent security features, and conventional encryption methods are inefficient for high-speed broadband systems, particularly due to high computational complexity and reliance on pilot symbols, which may not be suitable for future communication systems.
Innovation Solution
A secure encryption/decryption algorithm operating on time-domain samples after the IFFT process, hiding synchronization information based on a secret key sequence, making it difficult for attackers to recover data without correct synchronization parameters, and utilizing a chaotic cryptographic system to ensure strong security with low computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional encryption algorithms (DES, AES) are implemented for data security in OFDM systems, then security is improved, but processing speed decreases
Solution Approach 1:
The patent replaces conventional mechanical/cryptographic encryption algorithms (DES, AES) with a chaotic encryption system that uses chaotic maps to generate pseudorandom sequences for encrypting OFDM symbols. This substitution maintains security while significantly improving processing speed to match broadband system requirements.
Solution Approach 2:
The patent changes the encryption approach from traditional block ciphers to chaotic parameter-based encryption, where chaotic systems with sensitive dependence on initial conditions are used. By changing parameters like control parameters of chaotic maps and initial conditions, the system achieves both security and high processing speed.
2Reliability
If encryption is applied to baseband QAM symbols before IFFT, then security is improved, but synchronization and channel estimation become difficult
Solution Approach 1:
The patent segments the encryption process by applying encryption only to data subcarriers while leaving pilot subcarriers unencrypted. This segmentation allows the receiver to use unencrypted pilots for synchronization and channel estimation, while encrypted data subcarriers provide security.
Solution Approach 2:
The patent uses pilot symbols as intermediaries that remain unencrypted to facilitate synchronization and channel estimation. These pilots act as a bridge between the encrypted data and the receiver's ability to properly decode them, without compromising overall security.
3Reliability
If pilot symbols are encrypted for security, then security is improved, but channel estimation performance deteriorates
Solution Approach 1:
The patent segments subcarriers into data subcarriers and pilot subcarriers, applying encryption selectively to only the data subcarriers. This segmentation preserves the integrity of pilot symbols for accurate channel estimation while maintaining security through encryption of data subcarriers.
4Reliability
If frequency domain symbols are scrambled for encryption, then security is improved, but computational complexity increases
Solution Approach 1:
The patent replaces complex frequency-domain encryption operations with simpler time-domain chaotic encryption. By substituting the encryption mechanism to operate in the time domain using chaotic maps, the system reduces computational complexity while maintaining security.
Data Source
AI summary
A chaotic cryptographic technique for orthogonal frequency division multiplexing (OFDM) based wireless/wired communication systems is implemented with an OFDM symbol structure based on symmetric key cryptography. At the receiver side, data detection becomes infeasible without knowledge of the secret key. Without the knowledge of the key, the signal will be a noise-like signal. The computational power required to implement the technique is very low, rendering the system an attractive option for high data rate communications based on OFDM technology. The system security is proportional to (L×N)! where N is the number of subcarriers in the OFDM system and L is the number of OFDM symbols involved in the encryption process. For OFDM applications where ≧256, L may be set to 1 and breaking the system would require N! exhaustive-search trials. In the case that N<256, L may be increased.