Abstract

In cryptosystems, the generation of random keys is crucial. The random number generator is required to have a sufficiently fast generation speed to ensure the size of the keyspace. At the same time, the randomness of the key is an important indicator to ensure the security of the encryption system. The chaotic random number generator has been widely used in cryptosystems due to the uncertainty, non-repeatability, and unpredictability of chaotic systems. However, chaotic systems, especially high-dimensional chaotic systems, have slow calculation speed and long iteration time. This caused a conflict between the number of random keys and the speed of generation. In this paper, we introduce the Least Squares Generative Adversarial Networks(LSGAN)into random number generation. Using LSGAN’s powerful learning ability, a novel learning random number generator is constructed. Six chaotic systems with different structures and different dimensions are used as training sets to realize the rapid and efficient generation of random numbers. Experimental results prove that the encryption key generated by this scheme can pass all randomness tests of the National Institute of Standards and Technology (NIST). Hence, our result shows that LSGAN has the potential to improve the quality of the random number generators. Finally, the results are successfully applied to the image encryption scheme based on selective scrambling and overlay diffusion, and good results are achieved.

Highlights

  • With the rapid development of network communication and multimedia technology, more and more digital images are stored, copied, and transmitted through various types of thirdparty platforms or unsecured channels [5]

  • After an in-depth study, we have found that the image encryption algorithm has a promoted requirement of random numbers

  • We find that the random numbers generated by QCNN, 4D hyperchaotic system and Lorenz chaotic system iterating 100 times in LSGAN can pass all National Institute of Standards and Technology (NIST) tests, while fractional Chen hyperchaotic system, 3D chaotic system and Henon chaotic system need to iterate 500 times in LSGAN

Read more

Summary

Introduction

With the rapid development of network communication and multimedia technology, more and more digital images are stored, copied, and transmitted through various types of thirdparty platforms or unsecured channels [5]. Many schemes of generating random numbers based on chaos have been proposed, but they have little help to improve the security of encryption algorithms [20, 46, 52, 53, 59]. Gong l et al proposed an effective image compression and encryption algorithm based on chaotic systems and compressed sensing. In this scheme, the logistic map and 1D cascade map are used as key generators [14]. Simulation results and security analysis show that the random number generated by this scheme can pass all the tests in NIST, and the efficiency of key generation is improved.

Random numbers generator with LSGAN
Data set preparation
Generation of random numbers
Entropy analysis
Randomness analysis
Efficiency analysis
Encryption algorithm
Experimental simulation and performance analysis
Key space
Information Entropy
Histogram analysis
Correlation of two adjacent pixels
Peak signal-to-noise ratio
Differential attack
Speed analysis
Robustness against cropping
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call