Chaos Parameters
Parameters Not Synchronized
3.99
0.1
User A (Sender)
Online
User B (Receiver)
Online
Encryption Process Visualization
1. Original Message
2. Chaotic Key Stream (First 20 values)
Key stream will appear here...
3. Encrypted Message
4. Decrypted Message
How Chaos-Based Encryption Works
The Logistic Map
The equation x(n+1) = r × x(n) × (1 - x(n)) generates chaotic behavior when r is between 3.57 and 4.0, creating pseudo-random sequences perfect for encryption.
Encryption Steps
- Initialize Logistic Map with shared secret parameters
- Generate chaotic sequence by iterating the map
- Convert message to binary representation
- XOR message bits with chaotic key stream
- Transmit encrypted ciphertext
- Receiver uses same parameters to generate identical key stream
- XOR ciphertext with key stream to decrypt original message
Security Features
- Large Key Space: 2¹⁰⁰+ combinations
- Sensitivity: Extreme sensitivity to initial conditions
- Non-linear Dynamics: Provides confusion and diffusion
- Pseudo-random Generation: High-quality randomness
- Symmetric Encryption: Uses shared secret parameters
Chaotic Sequence Visualization
Real-time visualization of the chaotic sequence generated by the Logistic Map
Security Analysis
Key Sensitivity Test
Small parameter changes produce completely different key streams
Randomness Quality
Statistical analysis of generated sequences
Mean: -
Std Dev: -
Encryption Strength
Current parameter security level
High Security