Cryptanalysis of a Classical Chaos-Based Cryptosystem with Some Quantum Cryptography Features

Arroyo, David; Hernández, Fernando; Orue, A. B.

doi:10.1142/s0218127417500043

Cited by 17 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the average variance of the cipher image of Lena (256 × 256) was 229, but it was 81,231 for the plain Lena image. The given comparison also shows that for the majority of test images, the histogram variances of images encrypted by the proposed algorithm were lower than those in [41,43]. On the basis of this comparison, we can say that our proposed algorithm has the ability to make the encryption algorithm more secure.…”

Section: Histogram Analysismentioning

confidence: 72%

See 1 more Smart Citation

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Butt

Khan

et al. 2020

Entropy

View full text Add to dashboard Cite

Bit-level and pixel-level methods are two classifications for image encryption, which describe the smallest processing elements manipulated in diffusion and permutation respectively. Most pixel-level permutation methods merely alter the positions of pixels, resulting in similar histograms for the original and permuted images. Bit-level permutation methods, however, have the ability to change the histogram of the image, but are usually not preferred due to their time-consuming nature, which is owed to bit-level computation, unlike that of other permutation techniques. In this paper, we introduce a new image encryption algorithm which uses binary bit-plane scrambling and an SPD diffusion technique for the bit-planes of a plain image, based on a card game trick. Integer values of the hexadecimal key SHA-512 are also used, along with the adaptive block-based modular addition of pixels to encrypt the images. To prove the first-rate encryption performance of our proposed algorithm, security analyses are provided in this paper. Simulations and other results confirmed the robustness of the proposed image encryption algorithm against many well-known attacks; in particular, brute-force attacks, known/chosen plain text attacks, occlusion attacks, differential attacks, and gray value difference attacks, among others.

show abstract

Section: Histogram Analysismentioning

confidence: 72%

“…Secondly, the key must be tremendously sensitive to bit changes. If the key is not subtle enough, then a similar key may also be able to decrypt the cipher image [42,43].…”

Section: Key Space and Key Sensitivitymentioning

confidence: 99%

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Butt

Khan

et al. 2020

Entropy

View full text Add to dashboard Cite

show abstract

“…Tremendously sensitive toward any change in the secret key is one of the key requirements of an image encryption algorithm. If the encryption algorithm will not have high sensitivity toward a slight change in the secret key or if it will not be subtle enough, then a similar key may also be able to decrypt the cipher image 57,58 . Thus, to test the key sensitivity, we have inspected the number of bit change rate ( X NBCR ) 59 .…”

Section: Results and Security Analysismentioning

confidence: 99%

“…If the encryption algorithm will not have high sensitivity toward a slight change in the secret key or if it will not be subtle enough, then a similar key may also be able to decrypt the cipher image. 57,58 Thus, to test the key sensitivity, we have inspected the number of bit change rate (X NBCR ). 59 The X NBCRs of the two images P img1 and P img2 can be defined as,…”

Section: Key Sensitivitymentioning

confidence: 99%

Security of multimedia communication with game trick based fast, efficient, and robust color‐/gray‐scale image encryption algorithm

Khan

Han

Qian

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Freshly, an innumerable chaotic system based complex and more time‐consuming image encryption algorithms have been proposed. The majority of those have scrambling and diffusion like two phases or rounds before performing the actual encryption, which leads toward extra time consumption. So unlike those, this article presents a novel image encryption algorithm that is based on game trick. The proposed novel method is DNA based and it can accomplish dual function with one round, that is, scrambling for the bit planes and diffusion for the pixels, So we called it as DNA‐SPD. First of all, a random matrix equivalent to the size of the original image is generated through a python random array generator and seed value of the 512‐bit hexadecimal key of the original image. Second, it performs the pixel adaptive additions with MA between pixels of a plain image, random matrix, the integer value of the hash key entity, and the decimal number (DN). Third, it extracts each channel from the color image and convert it into the binary bit planes, then transformed it into the DNA bit planes through particular DNA rules. Finally, a universal DNA rule utilized to get back encrypted pixels. Various security analysis and comparison of projected results show that the proposed novel encryption method gives better results in a lesser amount of time. The proposed algorithm is robust against the well‐known and effective attacks, that is, known/chosen plaintext attacks, differential attacks, and the statistical attacks. Therefore, the proposed algorithm is more secure and reliable for the security of image communication.

show abstract

“…The main advantage of this method is what it allows to produce a more accurate research of the behaviour of solutions of dynamical systems in very large time segments. Let us note that the FGBFI-method can be used in the encryption system, constructed by means of continuous-time chaotic systems [47], and also for verification of approximate periodic solutions of continuous nonlinear dynamical systems [48,49].…”

Section: Introductionmentioning

confidence: 99%

An Accurate Numerical Method and Algorithm for Constructing Solutions of Chaotic Systems

Pchelintsev

2020

JAND

View full text Add to dashboard Cite

In various fields of natural science, the chaotic systems of differential equations are considered more than 50 years. The correct prediction of the behaviour of solutions of dynamical model equations is important in understanding of evolution process and reduce uncertainty. However, often used numerical methods are unable to do it on large time segments. In this article, the author considers the modern numerical method and algorithm for constructing solutions of chaotic systems on the example of tumor growth model. Also a modification of Benettin's algorithm presents for calculation of Lyapunov exponents.

show abstract

Cryptanalysis of a Classical Chaos-Based Cryptosystem with Some Quantum Cryptography Features

Cited by 17 publications

References 26 publications

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Security of multimedia communication with game trick based fast, efficient, and robust color‐/gray‐scale image encryption algorithm

An Accurate Numerical Method and Algorithm for Constructing Solutions of Chaotic Systems

Contact Info

Product

Resources

About