Modification of Intertwining Logistic Map and a Novel Pseudo Random Number Generator

Wenbo Zhao, Caochuan MaSymmetry 2024 · DOI

TL;DR

This paper introduces a modified, computationally efficient chaotic map called the "Simple Intertwining Logistic" map, which maintains complex dynamics. This new map is then used to develop a novel pseudo-random number generator (PRNG) that demonstrates strong statistical properties, high speed, and resistance to attacks, making it suitable for cryptographic applications.

What Problem Does This Paper Address?

The field of cryptography heavily relies on generating unpredictable sequences of numbers, often achieved through pseudo-random number generators (PRNGs). While chaotic maps offer desirable properties like sensitivity to initial conditions and complex dynamics, their practical application in cryptography is hindered by computational complexity and the difficulty of hardware implementation, particularly due to transcendental functions. Existing chaotic cryptosystems often overlook these engineering demands. This paper aims to bridge this gap by proposing a modified chaotic map that is both computationally efficient and hardware-friendly, while still exhibiting strong chaotic behavior, and then leveraging this map to create a practical and secure PRNG.

Methods

The core of this work involves two main methodological contributions:

  • Modification of the Intertwining Logistic Map: The authors tackle the computational burden of the original three-dimensional Intertwining Logistic map. They achieve this by:
  • Simplifying Transcendental Functions: The sin(wn) function, a computationally expensive transcendental function, is replaced with a polynomial approximation derived from Taylor series expansion. This significantly reduces floating-point operations.
  • Parameter Optimization: Through "Scale Index" analysis, a method to measure signal aperiodicity, they identify optimal integer values for the map's input parameters (k1, k2, k3 = 64). This further simplifies calculations and hardware implementation. The resulting map is named the "Simple Intertwining Logistic" map.

  • Novel Pseudo-Random Number Generator (PRNG) Design: Based on the "Simple Intertwining Logistic" map, a new PRNG is proposed. The design involves:

  • Initialization: Using initial conditions (u0, v0, w0) and a control parameter (μ) as the key.
  • Transient Removal: Iterating the map 1000 times to discard initial transient effects.
  • Output Generation: A specific method for extracting pseudo-random numbers from the map's state variables.

Datasets

The paper does not introduce new datasets. Instead, it relies on generated sequences from the proposed chaotic map and existing maps (logistic, Henon, intertwining logistic) for evaluation. Standard statistical test suites are used to assess the randomness of the generated sequences.

Key Insights and Ideas

  • Polynomial Approximation for Efficiency: Replacing transcendental functions with polynomial approximations is a viable strategy to significantly improve the computational efficiency of chaotic maps for practical applications, without sacrificing too much of their chaotic nature.
  • Scale Index as a Practical Optimization Tool: The Scale Index method proved effective not only for analyzing the non-periodicity of chaotic sequences but also for guiding the selection of optimal integer parameters for hardware-friendly implementations.
  • Hardware-Friendly Chaos: The modification successfully reduces the reliance on complex transcendental functions, making the proposed map more amenable to hardware implementation, which is a critical bottleneck for many chaotic cryptosystems.
  • High Randomness Despite Simplification: Even with structural simplifications, the "Simple Intertwining Logistic" map retains complex dynamics and exhibits high randomness, as validated by various statistical tests.
  • PRNG Performance: The proposed PRNG demonstrates a compelling balance of security (large key space, sensitivity to initial conditions) and speed, outperforming many existing chaotic PRNGs.

Key Results

  • Speed Improvement: The "Simple Intertwining Logistic" map offers a 2x speed boost compared to the original intertwining logistic map in software implementation. When used in the PRNG, the speed is 1.5 times faster than the original map with the same PRNG scheme.
  • Statistical Tests: The proposed PRNG successfully passed all tests in the NIST SP800-22 suite and the DIEHARD test suite, indicating high randomness and suitability for cryptographic use.
  • Key Space: The estimated key space is approximately 2^212, which is considered sufficiently large to resist brute-force attacks.
  • Sensitivity: The PRNG exhibits high sensitivity to initial conditions, with correlation coefficients between sequences generated by slightly different seeds being close to zero.
  • Fuzzy Entropy: The proposed map shows the largest Fuzzy Entropy values among compared maps, even under low-precision digital conditions, suggesting robustness against chaos degradation.

Limitations and Future Work

  • Limitations:
    • The paper acknowledges that fixing parameters (k1, k2, k3) reduces the key space compared to a fully variable system, but argues that the remaining key space is still sufficient.
  • While the paper focuses on software and hardware efficiency, a deeper analysis of the trade-offs between approximation accuracy and cryptographic strength might be beneficial.
  • Future Work:
    • The authors plan to explore applications of the proposed map in image encryption and video authentication.
  • They also intend to design a secure hash function scheme using discrete and high-dimensional continuous chaotic maps.
  • Further research will focus on designing rule graphs as authentication marks.

Summary updated

BibTeX
@article{zhao2024modification,
  author = {Wenbo Zhao and Caochuan Ma},
  title = {{Modification of Intertwining Logistic Map and a Novel Pseudo Random Number Generator}},
  journal = {Symmetry},
  year = {2024},
  doi = {10.3390/sym16020169},
}
Figure