In order to improve the security and efficiency of image encryption, many researchers have continuously proposed new image encryption schemes in recent years. However, these image encryption schemes have not been fully analyzed and evaluated. In this paper, a newly reported image encryption scheme based on Feistel network and dynamic Deoxyribonucleic Acid (DNA) encoding is deeply and comprehensively investigated. This encryption scheme mainly adopts four encryption steps to encrypt the plain image, which are Generation of chaotic sequences, Hill encryption, Feistel network, and Pixel diffusion. Our analyses show that there are some problems in the secret key design and encryption process of this encryption scheme. After pointing out and analyzing these problems, we have made several necessary improvements to this encryption scheme and proposed the corresponding chosen-plaintext attack algorithm. The subsequent simulation tests and analyses have confirmed the effectiveness and feasibility of the proposed attack algorithm. Finally, for the problems in this encryption scheme and some current image encryption schemes, improvement suggestions are presented to provide references for the designers of future image encryption schemes.

Image encryption is an effective way to protect image data. However, existing image encryption algorithms are still unable to strike a good balance between security and efficiency. To overcome the shortcomings of these algorithms, an image encryption algorithm based on plane-level image filtering and discrete logarithmic transformation (IEA-IF-DLT) is proposed. By utilizing the hash value more rationally, our proposed IEA-IF-DLT avoids the overhead caused by repeated generations of chaotic sequences and further improves the encryption efficiency through plane-level and three-dimensional (3D) encryption operations. Aiming at the problem that common modular addition and XOR operations are subject to differential attacks, IEA-IF-DLT additionally includes discrete logarithmic transformation to boost security. In IEA-IF-DLT, the plain image is first transformed into a 3D image, and then three rounds of plane-level permutation, plane-level pixel filtering, and 3D chaotic image superposition are performed. Next, after a discrete logarithmic transformation, a random pixel swapping is conducted to obtain the cipher image. To demonstrate the superiority of IEA-IF-DLT, we compared it with some state-of-the-art algorithms. The test and analysis results show that IEA-IF-DLT not only has better security performance, but also exhibits significant efficiency advantages.

Over the past few years, chaotic image encryption has gained extensive attention. Nevertheless, the current studies on chaotic image encryption still possess certain constraints. To break these constraints, we initially created a two-dimensional enhanced logistic modular map (2D-ELMM) and subsequently devised a chaotic image encryption scheme based on vector-level operations and 2D-ELMM (CIES-DVEM). In contrast to some recent schemes, CIES-DVEM features remarkable advantages in several aspects. Firstly, 2D-ELMM is not only simpler in structure, but its chaotic performance is also significantly better than that of some newly reported chaotic maps. Secondly, the key stream generation process of CIES-DVEM is more practical, and there is no need to replace the secret key or recreate the chaotic sequence when handling different images. Thirdly, the encryption process of CIES-DVEM is dynamic and closely related to plaintext images, enabling it to withstand various attacks more effectively. Finally, CIES-DVEM incorporates lots of vector-level operations, resulting in a highly efficient encryption process. Numerous experiments and analyses indicate that CIES-DVEM not only boasts highly significant advantages in terms of encryption efficiency, but it also surpasses many recent encryption schemes in practicality and security.

Chaos-based encryption is promising for safeguarding digital images. Nonetheless, existing chaos-based encryption algorithms still exhibit certain shortcomings. Given this, we propose a novel multi-channel image encryption algorithm that leverages pixel reorganization and hyperchaotic maps (MIEA-PRHM). Our MIEA-PRHM algorithm employs two hyperchaotic maps to jointly generate chaotic sequences, ensuring a larger key space and better randomness. During the encryption process, we first convert input images into two fused matrices through pixel reorganization. Then, we apply two rounds of scrambling and diffusion operations, coupled with one round of substitution operations, to the high 4-bit matrix. For the low 4-bit matrix, we conduct one round of substitution and diffusion operations. Extensive experiments and comparisons demonstrate that MIEA-PRHM outperforms many recent encryption algorithms in various aspects, especially in encryption efficiency.

Amid growing threats of image data leakage and misuse, image encryption has become a critical safeguard for protecting visual information. However, many recent image encryption algorithms remain constrained by trade-offs between security, efficiency, and practicability. To address these challenges, this paper first proposes a novel two-dimensional variable fractional-order coupled quadratic hyperchaotic map (2D-VFCQHM), which incorporates a state-dependent dynamic memory effect, wherein the fractional-order is adaptively determined at each iteration by the mean of the system’s current state. This mechanism substantially enhances the complexity and unpredictability of the underlying chaotic dynamics. Building upon the superior hyperchaotic properties of the 2D-VFCQHM, we further develop a high-performance image encryption algorithm that integrates a novel fusion strategy within a dynamic vector-level diffusion-scrambling framework (IEA-VMFD). Comprehensive security analyses and experimental results demonstrate that the proposed algorithm achieves robust cryptographic performance, including a key space of $2^{298}$, inter-pixel correlation coefficients below 0.0018, ciphertext entropy greater than 7.999, and near-ideal plaintext sensitivity. Crucially, the algorithm attains an encryption speed of up to 126.2963 Mbps. The exceptional balance between security strength and computational efficiency underscores the practical viability of our algorithm, rendering it well-suited for modern applications such as telemedicine, instant messaging, and cloud computing.