|
|
|
Two-dimensional-lag complex logistic map with complex parameters and its encryption application |
| Fangfang Zhang(张芳芳)1, Jinbo Wu(武金波)1, Lei Kou(寇磊)2, Fengying Ma(马凤英)1,†, Liming Wu(吴黎明)1, and Xue Zhang(张雪)1 |
1 School of Information and Automation Engineering, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250353, China;
2 Institute of Oceanographic Instrumentation, Qilu University of Technology (Shandong Academy of Sciences), Qingdao 266000, China |
|
|
|
|
Abstract With the rapid development of internet technology, security protection of information has become more and more prominent, especially information encryption. Considering the great advantages of chaotic encryption, we propose a 2D-lag complex logistic map with complex parameters (2D-LCLMCP) and corresponding encryption schemes. Firstly, we present the model of the 2D-LCLMCP and analyze its chaotic properties and system stability through fixed points, Lyapunov exponent, bifurcation diagram, phase diagram, etc. Secondly, a block cipher algorithm based on the 2D-LCLMCP is proposed, the plaintext data is preprocessed using a pseudorandom sequence generated by the 2D-LCLMCP. Based on the generalized Feistel cipher structure, a round function $F$ is constructed using dynamic S-box and DNA encoding rules as the core of the block cipher algorithm. The generalized Feistel cipher structure consists of two $F$ functions, four XOR operations, and one permutation operation per round. The symmetric dynamic round keys that change with the plaintext are generated by the 2D-LCLMCP. Finally, experimental simulation and performance analysis tests are conducted. The results show that the block cipher algorithm has low complexit, good diffusion and a large key space. When the block length is 64 bits, only six rounds of encryption are required to provide sufficient security and robustness against cryptographic attacks.
|
Received: 06 October 2023
Revised: 08 February 2024
Accepted manuscript online: 19 February 2024
|
|
PACS:
|
05.45.Pq
|
(Numerical simulations of chaotic systems)
|
| |
89.20.Hh
|
(World Wide Web, Internet)
|
| |
06.30.Ft
|
(Time and frequency)
|
|
| Fund: Project supported by the Shandong Province Natural Science Foundation (Grant Nos. ZR2023MF089, R2023QF036, and ZR2021MF073), the Industry-University-Research Collaborative Innovation Fund Project of Qilu University of Technology (Shandong Academy of Sciences) (Grant Nos. 2021CXY-13 and 2021CXY-14), the Major Scientific and Technological Innovation Projects of Shandong Province (Grant No. 2020CXGC010901), the Talent Research Project of Qilu University of Technology (Shandong Academy of Sciences) (Grant No. 2023RCKY054), and the Basic Research Projects of Science, Education and Industry Integration Pilot Project of Qilu University of Technology (Shandong Academy of Sciences) (Grant No. 2023PX081). |
Corresponding Authors:
Fengying Ma
E-mail: mafengy@163.com
|
Cite this article:
Fangfang Zhang(张芳芳), Jinbo Wu(武金波), Lei Kou(寇磊), Fengying Ma(马凤英), Liming Wu(吴黎明), and Xue Zhang(张雪) Two-dimensional-lag complex logistic map with complex parameters and its encryption application 2024 Chin. Phys. B 33 050505
|
[1] Zhang Z, Tang J, Ni H and Huang T 2023 Nonlinear Dyn. 111 10629
[2] Liu P, Wang X, Su Y, Liu H and Unar S 2023 IEEE Trans. Circuits Syst. I 70 2511
[3] Zhou S, Qiu Y, Wang X and Zhang Y 2020 Nonlinear Dyn. 111 9571
[4] Nan R, Hu L, Huang Z, Wang M and Luo G 2023 Expert Syst. Appl. 238 122052
[5] Nan R, Tong W and Zhou W 2023 Signal Process. 211 109107
[6] Gong L and Luo H 2023 Opt. Laser Technol. 167 109665
[7] Wang X and Liu P 2022 IEEE Trans. Circuits Syst. I 69 1291
[8] Zheng W, Yan L, Gou C and Wang F Y 2021 IEEE Trans. Cybern. 52 13181
[9] Liu X, Tong X, Zhang M, Wang Z and Fan Y 2023 Nonlinear Dyn. 111 8771
[10] Rezaei B, Ghanbari H and Enayatifar R 2023 Nonlinear Dyn. 111 9629
[11] Liu H, Zhang Y, Kadir A and Xu Y 2019 Appl. Math. Comput. 360 83
[12] Zhang F F, Huang Z, Kou L, Li Y, Cao M Y and Ma F Y 2023 Chin. Phys. B 32 010502
[13] Liu H, Wan H, Tse C K and Lu J 2016 IEEE Trans. Circuits Syst. I 63 2010
[14] Bensikaddour, E H, Bentoutou Y and Taleb N 2020 J. King Saud Univ.: Comput. Inf. Sci. 32 50
[15] Haddad S, Coatrieux G, Moreau-Gaudry A and Cozic M 2020 IEEE Trans. Inf. Forensics Secur. 15 2556
[16] Dhall S, Pal S K and Sharma K 2022 J. King Saud Univ.: Comput. Inf. Sci. 34 1533
[17] Cheng J, Guo S and He J 2022 IEEE Internet Things J. 9 11408
[18] Su Y, Tong X, Zhang M and Wang Z 2023 Nonlinear Dyn. 111 2841
[19] Tong X, Liu X, Liu J, Zhang M and Wang Z 2021 Int. J. Bifur. Chaos 31 2150152
[20] Zhang F F, Zhang X, Cao M Y, Ma F Y and Li Z 2021 IEEE Multimedia 28 96
[21] Teng L, Wang X and Xian Y 2022 Inf. Sci. 605 71
[22] Mahalingam H, Veeramalai T, Menon A R and Amirtharajan R 2023 Mathematics 11 457
[23] Hsieh K S and Wang C M 2022 J. Inf. Secur. Appl. 65 103126
[24] Singh A K, Chatterjee K and Singh A 2023 IEEE Trans. Industrial Informatics 19 1957
[25] Wu Y, Zhang L, Berretti S and Wan S 2023 IEEE Trans. Industrial Informatics 19 2089 |
| No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|
