Finite Precision Logistic Map Between Computational Efficiency and Accuracy with Encryption Applications

Citation:
Sayed, W. S., A. G. Radwan, A. A. Rezk, and H. A. H. Fahmy, "Finite Precision Logistic Map Between Computational Efficiency and Accuracy with Encryption Applications", Complexity, 2017.

Abstract:

Chaotic systems appear in many applications such as pseudo-random number generation, text encryption and secure image transfer. Numerical solutions of these systems using digital software or hardware inevitably deviate from the expected analytical solutions. Chaotic orbits produced using finite precision systems do not exhibit the infinite period expected under the assumptions of infinite simulation time and precision. In this paper, digital implementation of the generalized logistic map with signed parameter is considered. We present a fixed-point hardware realization of a Pseudo-Random Number Generator using the logistic map that experiences a tradeoff between computational efficiency and accuracy. Several introduced factors such as the used precision, the order of execution of the operations, parameter and initial point values affect the properties of the finite precision map. For positive and negative parameter cases, the studied properties include bifurcation points, output range, maximum Lyapunov Exponent, and period length. The performance of the finite precision logistic map is compared in the two cases. A basic stream cipher system is realized to evaluate the system performance for encryption applications for different bus sizes regarding the encryption key size, hardware requirements, maximum clock frequency, NIST and correlation, histogram, entropy and Mean Absolute Error analyses of encrypted images.

Notes:

Accepted