Selection Criteria of Digital Maps for Data Encryption Algorithms from the Viewpoint of Dynamical Chaos.

Abstract

The paper presents results obtained with the use of specially developed software in studies of key indicators of discrete maps: discrete Lyapunov exponent and discrete entropy. Estimation of these indicators for discrete chaotic maps enables one to establish their applicability to data encryption algorithms due to correlation between them and such characteristics of encryption algorithm as confusion and diffusion. Selection criteria for discrete chaotic maps to be used in data encryption algorithms have been formulated based on an analysis of the discrete Lyapunov exponent and discrete entropy depending on the cardinality of the set and map parameters for a fixed value of set's cardinality.