Time Scaling of Chaotic Systems: Application to Secure Communications

Donatello Materassi, Michele BassoInt. J. Bifurc. Chaos 2008 · OpenReview

TL;DR

This paper introduces a novel chaos-based encryption technique that leverages "time-scaling" transformations of chaotic systems. By modifying the time response of chaotic signals while preserving their phase portrait, the authors propose a secure communication scheme that is robust against common cryptanalytic attacks like Return Map attacks.

What Problem Does This Paper Address?

Securely transmitting digital information over analog channels is a persistent challenge. Chaotic systems, due to their inherent complexity and sensitivity to initial conditions, have emerged as a promising tool for encryption. Existing methods, such as Chaotic Masking, Chaotic Shifting Key (CSK), and Chaotic Modulation, have faced vulnerabilities to sophisticated cryptanalytic techniques, particularly Return Map attacks. These attacks exploit predictable patterns in the chaotic signals used for encryption, allowing an intruder to reconstruct the original message. The paper aims to address this by developing a more robust encryption scheme that is resistant to these known attacks.

Methods

The core of the proposed method lies in the concept of time-scaling transformations. This involves modifying a dynamical system's differential equation by multiplying its components with a time-scaling function, $\lambda(z, t)$. This function alters the system's time response without changing its fundamental phase portrait.

The authors then apply this to a Chaotic Shifting Key (CSK) scheme. In a standard CSK, a binary message bit switches between two different chaotic systems. Here, instead of switching systems, the time-scaling function $\lambda$ is modulated by the message bit. This means the same underlying chaotic system is used, but its time evolution is altered based on the bit being transmitted.

Specifically, the paper proposes a Time Scale CSK (TS-CSK) scheme where the time-scaling function $\Lambda(x,m)$ is defined piecewise based on a condition involving a state variable and a parameter $h$, and crucially, the message bit $m$. This function is designed to be discontinuous and strictly positive. The encryption key comprises parameters within this time-scaling function, such as $A_0$, $A_1$, $v$, and $h$.

Datasets

Not discussed in the paper. The paper focuses on theoretical analysis and simulation of a communication system, rather than training on or evaluating against specific datasets.

Key Insights and Ideas

  • Time-scaling preserves phase portrait: A crucial insight is that time-scaling transformations, while altering the speed of trajectories, do not change the fundamental geometric and topological properties of the system's phase portrait. This is key to maintaining the chaotic nature of the signal.
  • Time-scaling as a countermeasure: By altering the time response of the chaotic signal based on the message bit, the TS-CSK scheme makes it difficult for attackers to reconstruct the original message using methods that rely on the phase portrait or return maps of the unscaled system.
  • Robustness against Return Map attacks: The paper demonstrates theoretically and through simulations that the Return Map (RM) of the TS-CSK system remains unchanged regardless of the transmitted bit. This directly counters Return Map attacks, which rely on distinguishing RMs associated with different bits.
  • Sparse Return Time Maps: While Return Time Map (RTM) attacks are considered, the proposed scheme, with appropriate choices of parameters, generates sparse RTMs, making it difficult to discern distinct branches corresponding to different bits.
  • Pseudo-random false-switching: The paper also incorporates pseudo-random false-switching, inspired by prior work, to further confuse attackers by introducing non-informative switches that are difficult to predict.

Key Results

  • Theoretical proof of phase portrait preservation: Proposition 2.2 establishes that under certain conditions, the phase diagrams of the original and time-scaled systems are identical.
  • Return Map attack countered: The paper shows that the Return Map of the TS-CSK scheme is invariant to the transmitted bit, rendering standard Return Map attacks ineffective.
  • Return Time Map attack mitigated: Simulations suggest that the RTM attack is significantly hindered due to the sparse nature of the generated maps.
  • Effective synchronization: Figure 7 demonstrates successful synchronization at the receiver end for ten alternate bits, indicating reliable decryption. The synchronization error is shown to be low, with prompt synchronization/desynchronization events.

Limitations and Future Work

  • Theoretical guarantee for RTM: While simulations suggest RTM attacks are ineffective, the authors acknowledge that a theoretical guarantee for this would be desirable.
  • Practical realization: The paper mentions that choosing a very small value for the parameter $h$ (related to the width of the time-scaling slices) to enhance security might negate the possibility of physical realization of such communication devices.
  • Sophistication of time-scaling function: The authors suggest that a more sophisticated choice of the time-scaling function $\Lambda$ could potentially lead to better results in terms of security, synchronization time, and practical realization.
  • Exhaustive cryptanalysis: The study focuses on qualitative considerations and theoretical results for common attacks. A more exhaustive cryptanalytic study covering a wider range of attacks is implied as future work.

Summary updated

BibTeX
@article{materassi2008time,
  author = {Donatello Materassi and Michele Basso},
  title = {{Time Scaling of Chaotic Systems: Application to Secure Communications}},
  journal = {Int. J. Bifurc. Chaos},
  year = {2008},
  url = {https://openreview.net/forum?id=nXyWa4VLPM},
}

Loading related content...

Figure