Chaotic Maps: Applications to Cryptography and Network Generation for the Graph Laplacian Quantum States
- 54 Downloads
In this article, we proposed a new chaotic map and is compared with existing chaotic maps such as Logistic map and Tent map. The value of maximal Lyapunov exponent of the proposed chaotic map goes beyond 1 and shows more chaotic behaviour than existing one-dimensional chaotic maps. This shows that proposed chaotic maps are more effective for cryptographic applications. Further, we are using one-dimensional chaotic maps to generate random time series data and define a method to create a network. Lyapunov exponent and entropy of the data are considered to measure the randomness or chaotic behaviour of the time series data. We study the relationship between concurrence (for the two-qubit quantum states) and Lyapunov exponent with respect to initial condition and parameter of the logistic map which is showing how chaos can lead to concurrence based on such Lyapunov exponents.
KeywordsCryptography Logistic map Lyapunov exponent.
The authors are grateful to Satish Sangwan for valuable comments and suggestions.
- 1.M. Berezowski, M. Lawnik, Identification of fast-changing signals by means of adaptive chaotic transformations (2016), arXiv:1603.06763
- 3.S.H. Strogatz, Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering (CRC Press, 2018)Google Scholar
- 17.C. Jin, H. Liu, A color image encryption scheme based on arnold scrambling and quantum chaotic. IJ Netw. Secur. 19(3), 347–357 (2017)Google Scholar
- 18.A.G. Radwan, S.K. Abd-El-Hafiz, Image encryption using generalized tent map, in 2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS) (IEEE, 2013), pp. 653–656Google Scholar
- 19.X. Zhang, Y. Cao, A novel chaotic map and an improved chaos-based image encryption scheme. Sci. World J. 2014, (2014)Google Scholar