In this work a new encryption scheme, which is realized with a Chaotic Pseudo-Random Bit Generator (CPRBG) based on a Logistic map, is presented. The proposed system is used for encrypting text files for the purpose of creating secure data bases. The Logistic map is the most studied discrete nonlinear map because it has been used in many scientific fields. Also, the fact, that this discrete map has a known algebraic distribution, made the Logistic map a good candidate for use in the design of random bit generators. The proposed CPRBG, which is very easily implemented, uses the X-OR function, in the bit sequences, that are produced by two Logistic maps with different initial conditions and system’s parameters, to achieve better results concerning the “randomness” of the produced bits sequence. The detailed results of the statistical testing on generated bit sequences, done by the most well known tests of randomness: the FIPS-140-2 suite tests, confirmed the specific characteristics expected of random bit sequences.
[1]
J. Wrench.
Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth
,
1970
.
[2]
Alfred Menezes,et al.
Handbook of Applied Cryptography
,
2018
.
[3]
S. Tezuka.
Uniform Random Numbers: Theory and Practice
,
1995
.
[4]
William M. Daley,et al.
Security Requirements for Cryptographic Modules
,
1999
.
[5]
Xuanqin Mou,et al.
Pseudo-random Bit Generator Based on Couple Chaotic Systems and Its Applications in Stream-Cipher Cryptography
,
2001,
INDOCRYPT.