Abstract

Recently, an image encryption algorithm based on random walk and hyperchaotic systems has been proposed. The main idea of the original paper is to scramble the plain image by means of random walk matrix and then to append diffusion. In this paper, the encryption method with security holes is analyzed by chosen plaintext attack. In addition, this paper improves the original encryption algorithm. The experimental and simulation results show that the improved algorithm has the advantages of the original and can improve the ability to resist attack.

Highlights

  • With the development of the Internet and cryptography, communication encryption has attracted the attention of many researchers and has been applied in many fields [1,2].At the same time, the number of images transmitted over the Internet is increasing all the time [3]

  • When Fridrich [5] first applied the structure of permissive diffused junction encryption to image encryption, many chaotic image encryption schemes based on it appeared [6,7,8,9,10]; because the encryption algorithms have security holes, or only use one round encryption, it is extremely vulnerable to be cracked by chosenplaintext attacks [11,12,13]

  • The encryption scheme based on the random walk and hyperchaotic system has the advantage of the average value of pixels related to plaintext, which can be used as the diffusion basis to resist the general attack scheme

Read more

Summary

Introduction

With the development of the Internet and cryptography, communication encryption has attracted the attention of many researchers and has been applied in many fields [1,2]. Li et al [17] improved the security of the system through multiple rounds of encryption related to plaintext. Some plaintextrelated encryption algorithms [23,24,25] are attacked by chosen plaintext because of the small key space. Researchers [29,30,31,32] integrate the plaintextrelated hash function into the encryption algorithm to increase the key space, resulting in the failure of traditional chosen plaintext attacks. Due to the random walk matrix used for the scramble, the initial position and direction of the motion are controlled by the random numbers obtained from the chaotic system, with a significantly better safety performance than other encryption schemes mentioned above. The special point of this paper is to verify whether the chaotic encryption of multiple random sequences in the scrambled stage and diffusion stage is invalid.

Review of the Original Image Encryption Scheme
The Secret Key Generation Stage
Random Walk Matrix
Scrambling
Diffusion
Cryptanalysis
Obtain
Obtain Diffusion Key
Gets the Scrambling Rule
Restore Plaintext Image
Summary
Section 2.3.
Performance of the Improved Cryptosystem
Histogram Analysis
11. Correlation
Information Entropy Analysis
Differential Attack Analysis
Computational and Complexity Analysis
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.