Statistical tests and chaotic synchronization based pseudorandom number generator for string bit sequences with application to image encryption
- 180 Downloads
Recently, a stream encryption scheme using d-bit segment sequences has been proposed. This scheme may generate key avalanche effect. The randomness tests of d-bit segment pseudorandom number generator will be important for implementing such a scheme. Firstly this paper extends Beker and Piper’s binary pseudorandom sequence statistical test suite to d-bit segment sequences case. Secondly, a novel 3-dimensional polynomial discrete chaotic map (3DPDCM) is proposed. The calculated Lyapunov exponents of the 3DPCDM are 0.213, 0.125 and − 3.228. Using the 3DPDCM constructs a 6-dimensional generalized synchronization chaotic system. Based on this system, a 8-bit segment chaotic pseudorandom number generator (CPRNG) is introduced. Using the generalized test suite tests 100 key streams generated via the 8-bit PRNG with different initial conditions and perturbed system parameters. The tested results are similar to those of the key streams generated via RC4 PRNG. As an application, using the key streams generated via the CPRNG and the RC4 PRNG encrypts an RGB image Landscape. The results have shown that the encrypted RGB images have significant avalanche effects. This research suggests that the requirements for PRNGs are not as strict as those under the traditional avalanche criteria. Suitable designed chaos-based d-bit string PRNGs may be qualified candidates for the stream encryption scheme with avalanche effect.
KeywordsEuropean Physical Journal Special Topic Test Suite Encrypt Image Pseudorandom Number Generator Generalize Synchronization
Unable to display preview. Download preview PDF.
- 2.N. Ferguson, B. Schneier, T. Kohno, Cryptography Engineering: Design Principles and Practical Applications (Wiley Publishing, 2010)Google Scholar
- 3.S. Banerjee, Chaos Synchronization and Cryptography for Secure Communications: Applications for Encryption (IGI Global, 2010)Google Scholar
- 4.G. Marsaglia, Diehard test suite, 1996, http://www.stat.fsu.edu/pub/diehard/
- 5.NIST, FIPS PUB 140-2, security requirements for cryptographic modules (NIST, Gaithersburg, MD, 2001)Google Scholar
- 6.A. Rukhin, J. Soto, J. Nechvatal, et al., A Statistical Test Suite for Random and Pseudorandom Number Generator for Cryptographic Applications (NIST Special Publication, 2001)Google Scholar
- 8.H. Beker, F. Piper, Cipher systems: the protection of communications (van Nostrand Reinhold, New York, 1982)Google Scholar
- 9.J.G. Spropt, Chaos and Time-Series Analysis (University Press, Oxford, 2003)Google Scholar
- 26.L. Min, L. Hao,L. Zhang, Study on the Statistical Test for String Pseudorandom Number Generators, in Lecture Notes Artificial Intelligence, edited by D. Liu, et al., Vol. 7888 (Springer-Verlag, Berlin, 2013), p. 278Google Scholar
- 27.S.W. Golomb, Shift Register Sequences (Laguna Hills, Aegean Park, CA, 1982)Google Scholar
- 28.A. Menezes, P. Vanorschot, S. Vanstone, Handbook of Applied Cryptography (CRC Press, 1996)Google Scholar
- 29.H. Zang, L. Min, G. Zhao, A generalized synchronization theorem for discrete-time chaos system with application in data encryption scheme, in Proc. of the 2007 Int. Conf. on Communications, Circuits and Systems, Vol. II (Kokura, Fukuoka, Japan, 2007), p. 1325Google Scholar