2022/08/14 by Chengqing Li, Li, Chengqing, Xianhui Shen +3
Computer Science · Mathematics · #94A60 #Algorithms and Data Compression #Chaos-based Image/Signal Encryption #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Mathematical Dynamics and Fractals
paper · pdf · doi:10.48550/arxiv.2208.06774
openalex publication_date 2022/08/14 · openalex created_date 2022/08/17 · openalex updated_date 2026/07/28
This paper analyzes security performance of an image encryption algorithm using 2D lag-complex Logistic map (LCLM), which adopts it as a pseudo-random number generator, and uses the sum of all pixel values of the plain-image as its initial value to control the random combination of the basic encryption operations. However, multiple factors make the final pseudo-random sequences controlling the encryption process may be the same for different plain-images. Based on this point, we proposed a chosen-plaintext attack by attacking the six encryption steps with a strategy of divide and conquer. Using the pitfalls of 2D-LCLM, the number of required chosen plain-images is further reduced to 5⋅log2(MN)+95, where MN is the number of pixels of the plain-image.