Chaos has practical significance in various domains, including the stock market, quantum physics, communication networks, disease diagnosis, cosmic events, and digital data security. Chaotic maps are widely utilised f...
详细信息
Chaos has practical significance in various domains, including the stock market, quantum physics, communication networks, disease diagnosis, cosmic events, and digital data security. Chaotic maps are widely utilised for encrypting multimedia data for secure communication due to their sensitivity to initial conditions and unpredictability. However, some chaotic maps suffer from weak chaotic dynamics that can make them vulnerable to certain types of attacks, limiting their effectiveness in sensitive applications such as encryption or secure communication in military operations and personal data. This research study proposes a novel nonlinear discrete chaotic map termed a coupled Kaplan-Yorke-Logistic map. By coupling chaotic maps, the Kaplan-Yorke map and the Logistic map, we have significantly enhanced key features such as the length of chaotic orbits, output distribution, and the security of chaotic sequences. An empirical assessment of the proposed coupled Kaplan-Yorke-Logistic map in terms of several measures such as bifurcation diagrams, phase diagrams, Lyapunov exponent analysis, permutation entropy, and sample entropy shows promising ergodicity and a diverse range of hyperchaotic behaviours compared to several recent chaotic maps. Consequently, the proposed map is utilised to develop an efficient image encryption algorithm. The encryptionalgorithm employs a methodology that utilises simultaneous confusion and diffusion processes aiming to significantly reduce the computation time for encryption and decryption processes for realtime applications without compromising the security parameters. A thorough assessment of the proposed image encryption algorithm is performed on a variety of image datasets by utilising multiple cryptanalysis methods, including key space analysis, information entropy, correlation coefficient evaluation, differential attack, key sensitivity testing, histogram analysis, computational time analysis, and occlusion and noise attacks. Comparat
The principal constituent of a block cipher in symmetric-key cryptography is the Boolean function, determining the substitution box (S-box). Block ciphers rely totally on S-boxes with excellent nonlinearity and uprigh...
详细信息
The principal constituent of a block cipher in symmetric-key cryptography is the Boolean function, determining the substitution box (S-box). Block ciphers rely totally on S-boxes with excellent nonlinearity and upright cryptographic structures. In AES, an 8 x 8 S-box is a 16 x 16 lookup table over the Galois field GF(2(8)), that occupies 8 x 2(8) bytes storage of computer memory. By using traditional method to construct a 24 x 24 S-box over Galois field GF(2(24)), which lodges a storage memory of 24 x 2(24) bytes in traditional sense. Thus, the memory storage does not support a 24 x 24 S-box over a very larger order Galois field like GF(2(24)). A resolute of this difficulty is possibly coming out from the algebraic structure of the commutative finite chain ring F-q[x]/ = Sigma(k-1)(i=0) x(i)F(q). In this study, a subgroup of the multiplicative group of units of the chain ring F-2[x]/ = Sigma(23x)(i=0)iF(2) is considered to construct a 24 x 24 S-box that occupy just 24 x 2(8) bits storage memory of computer. The proposed S-box has a substantial potential to create confusion during substitution phase of the color image enciphering algorithm. While for the permutation component of the algorithm, DNA transform is applied for creating diffusion in the pixels of the color image. The proposed RGB imageencryption attains the standard optimum level when compared it to the DNA and chaos-based imageencryption techniques.
A novel digital imageencryption scheme based on Poker shuffling and fractional order hyperchaotic system is proposed. Poker intercrossing operation has nonlinearity and periodicity, and can form permutation group. Fi...
详细信息
A novel digital imageencryption scheme based on Poker shuffling and fractional order hyperchaotic system is proposed. Poker intercrossing operation has nonlinearity and periodicity, and can form permutation group. Firstly, the plain image is transformed into block image, and each block is confused by Poker shuffling operation with key. Secondly, bit plane of every pixel in each block is confused. Lastly, the scrambled image is encrypted by fractional order hyperchaotic sequence. This encryption scheme provides a secure and efficient key stream, and guarantees a large key space. The experimental results and security analysis imply that the new encryption method has secure encryption effect and property of resisting common attacks.
It describes an improved encryptionalgorithm of a three-dimensional image based on multiple chaotic systems. The algorithm uses a variety of chaotic encryption system to cut the image into three-dimensional matrix sy...
详细信息
It describes an improved encryptionalgorithm of a three-dimensional image based on multiple chaotic systems. The algorithm uses a variety of chaotic encryption system to cut the image into three-dimensional matrix systems, in three-dimensional space do the image scrambling transformation, three-dimensional chaotic sequence output by multiple chaotic systems achieved three color pixel substitution transformation of the spatial color image. Finally, according to the theoretical analysis and simulation results it shows that the encryptionalgorithm with large key space, good confidentiality, and the pixel values of the encryptionimage has a random uniform distribution features and zero correlation of the neighboring pixel values, verifies the proposed scheme has high security.
暂无评论