Chaos and Undetectable Communications

The talk contrasts covert communication with standard encryption. Here a warden only needs to decide whether a transmission happened, not read its contents, which turns the problem into a yes-or-no detection question. The speaker outlines the theoretical limits: with only a shared key, the amount of hidden data grows roughly with the square root of the channel uses, and it can grow without bound only under conditions such as uncertain noise, jamming, or crowded spectrum.

Three practical levers follow for making a waveform harder to find: lower the signal strength seen by the detector through directional transmission, spread energy across frequencies with frequency hopping, chirp, or direct-sequence spreading, and make the waveform look irregular so periodicity-based analysis finds nothing. Chaotic sequences serve the last two goals. Using the double pendulum and the logistic map as examples, the speaker distinguishes chaos, which is deterministic, from true randomness and notes that chaotic sequences have lower cross-correlation than pseudonoise sequences.

To close, the talk surveys chaos-based modulation schemes, from simple on-off keying to differential chaos shift keying, which avoids a synchronization channel but offers little security without a shared key. Advanced variants combine chaos with frequency hopping and OFDM. The main takeaway is that chaos can help a signal hide, but it still requires either a shared secret or a synchronization path, and keeping two chaotic generators in step is difficult.