Constructing a Nondegenerate m-Dimensional Integer-Domain Chaotic Map Model Over GF(2n) with Application in PRNG

To address the problem of dynamic degradation over a finite-precision platform of chaotic maps and the reversibility of linear chaotic maps, we propose an improved model over GF([Formula: see text]) that is called the nondegenerate [Formula: see text]-Dimensional [Formula: see text] Integer-Domain Chaotic Maps ([Formula: see text]D-IDCMs). This model incorporates modular exponentiation operation, and is capable of constructing nondegenerate IDCMs of any dimension. Moreover, we prove the irreversibility of [Formula: see text]D-IDCM and analyze its chaotic behaviors in terms of positive Lyapunov Exponents (LEs). The results of theoretical analysis show that the proposed [Formula: see text]D-IDCM model can obtain the desired positive LEs by appropriately configuring its coefficient matrix. Then, we present two instances, and analyze their LEs, Kolmogorov entropy, Sample entropy, Correlation dimension, and the dynamic analysis indicates that the chaotic map constructed by [Formula: see text]D-IDCM has ergodicity within a sufficiently large chaotic range. Finally, we design a Pseudo-Random Number Generator (PRNG) with a key to verify the practicability of the [Formula: see text]D-IDCM.