Multi-Map Orbit Hopping Chaotic Stream Cipher

Xiaowen Zhang, Li Shu, Ke TangarXiv 2006 · OpenReview

TL;DR

This paper introduces a novel chaotic stream cipher that leverages the "orbit hopping" mechanism inspired by spread spectrum techniques. By dynamically switching between multiple chaotic maps and their generated orbits, the cipher aims to produce a highly unpredictable and robust keystream, suitable for secure communication.

What Problem Does This Paper Address?

The paper tackles the challenge of designing secure and efficient stream ciphers for digital communications. Traditional stream ciphers often rely on pseudo-random number generators (PRNGs) that can be vulnerable to cryptanalysis if their underlying algorithms are known or if the generated sequences exhibit predictable patterns. The authors aim to enhance security by exploiting the inherent properties of chaotic systems: mixing (confusion), unpredictability, and extreme sensitivity to initial conditions (diffusion). They also draw inspiration from frequency hopping spread spectrum systems, which use a hopping pattern to make signals harder to detect and intercept. The goal is to create a cipher that is fast, computationally efficient, and secure, particularly for applications like wireless communications.

Methods

The core of the proposed cipher is a "multi-map orbit hopping" mechanism. Here's a breakdown of the key components:

  • Chaotic Map Bank: A collection of well-studied chaotic maps (specifically logistic maps and Chebyshev maps) are stored. These maps are carefully tuned to exhibit chaotic behavior.
  • Key-Driven Hopping: A secret key dictates the entire operation. It determines:
  • Which chaotic maps are selected from the bank.
  • The order in which these maps are used (the "hopping pattern").
  • The number of orbits to generate for each selected map.
  • The number of sample points to extract from each orbit.
  • Orbit Generation: For each selected chaotic map, a series of "orbits" are generated. An orbit is a sequence of states produced by repeatedly applying the chaotic map to an initial "seed" value. To ensure orbits are distinct, subsequent orbits are generated by slightly offsetting the seed of the previous orbit. A "settle" period (a number of initial iterations) is applied to each orbit before sampling to ensure sufficient divergence from adjacent orbits.
  • Random Number Extraction: From the sampled points of the chaotic orbits, pseudo-random numbers are extracted. The method involves removing the decimal point, padding/truncating to 8 digits, and then taking the result modulo 256. This produces random numbers in the range [0, 255], suitable for XORing with plaintext.
  • Keystream Generation: The extracted random numbers form the keystream, which is then combined with the plaintext using a simple XOR operation to produce the ciphertext.

Datasets

The paper uses a segment of Mark Twain's novel "Huckleberry Finn" as a plaintext dataset for demonstrating the encryption process and analyzing the resulting ciphertext distribution. The analysis is performed on both pure text and MS Word formats of the novel. No new benchmarks or datasets are introduced.

Key Insights and Ideas

  • Chaos as a Cryptographic Primitive: The paper strongly advocates for using the fundamental properties of chaos (mixing, sensitivity to initial conditions) as a robust foundation for cryptography, aligning them with the cryptographic concepts of confusion and diffusion.
  • Spread Spectrum Analogy: The "orbit hopping" mechanism is a clever adaptation of spread spectrum techniques. By rapidly switching between different chaotic maps and their generated sequences, the cipher aims to create a keystream that is spread across both time and the parameter space of the chaotic maps, making it difficult to predict or intercept.
  • Key Control Over System Dynamics: The key's comprehensive control over map selection, hopping order, orbit generation, and sampling points is a significant design feature. This allows for a variable key length and a highly customizable cipher, where the key itself defines the system's complexity and security parameters.
  • "Settle" Period for Orbit Dissimilarity: The introduction of a "settle" period for each orbit is crucial. It addresses the inherent sensitivity of chaotic systems to initial conditions, ensuring that even with small seed offsets, the generated orbits quickly diverge, leading to more distinct and unpredictable sequences for cryptographic use.

Key Results

  • The paper demonstrates the generation of a keystream using the proposed multi-map orbit hopping chaotic stream cipher.
  • Histograms of character frequencies for the plaintext and ciphertext of "Huckleberry Finn" show a significant improvement in distribution uniformity for the ciphertext. The plaintext exhibits clustering around common characters and spaces, while the ciphertext shows a much flatter, near-uniform distribution across all ASCII characters, indicating effective diffusion and resistance to frequency analysis.
  • The authors claim the cipher is fast, strong, computationally efficient, and easily implementable in software.

Limitations and Future Work

  • Cryptanalysis and Security Testing: The paper acknowledges that the proposed cipher has not yet undergone rigorous cryptanalysis. The authors state that future work will involve testing the cipher against standard randomness test suites like DIEHARD and NIST statistical test suite, as well as conducting dedicated cryptanalysis to assess its security against various attacks.
  • Combination Function: For the initial version, the cipher uses a simple XOR operation to combine the keystream with the plaintext. While functional, this could be a potential point of weakness. Future work might explore alternative, more robust combination functions.
  • Key Handling Efficiency: While the current key handling is described as simple, future versions aim to use shorter keys to generate all necessary subkeys, potentially improving key management efficiency.

Summary updated

Abstract

In this paper we propose a multi-map orbit hopping chaotic stream cipher that utilizes the idea of spread spectrum mechanism for secure digital communications and fundamental chaos characteristics of mixing, unpredictable, and extremely sensitive to initial conditions. The design, key and subkeys, and detail implementation of the system are addressed. A variable number of well studied chaotic maps form a map bank. And the key determines how the system hops between multiple orbits, and it also determines the number of maps, the number of orbits for each map, and the number of sample points for each orbits. A detailed example is provided.
BibTeX
@misc{zhang2006multi,
  author = {Xiaowen Zhang and Li Shu and Ke Tang},
  title = {{Multi-Map Orbit Hopping Chaotic Stream Cipher}},
  year = {2006},
  eprint = {cs/0601010},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/cs/0601010},
}
Figure