Correction to: Image cryptosystem based on plain image correlation rate and selective chaotic maps

Kari, Ahmad Pourjabbar; Navin, Ahmad Habibizad; Bidgoli, Amir Massoud; Mirnia, Mir Kamal

doi:10.1007/s11042-022-13625-1

Cited by 1 publication

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NPCR and UACI values between A1 and A2 are calculated using equations 9 to 11. The NPCR of about 100% and the UACI of about 33.33% [19] means that the two evaluated images are completely different from each other. In these equations, the encrypted image of the test image is called A1, and the encrypted image that is obtained by randomly changing the least significant bit in the (x, y) coordinates (Cameraman (x, y)) of the original image is called A2.…”

Section: Resistance To Differential Attacksmentioning

confidence: 92%

“…4.These results show that proposed method has a high sensitivity to security keys in both encryption and decryption process. Additionally, only a tiny difference of 10 −14 can result in significant changes in encryption/decryption results, which means the proposed algorithm has a large key space to defend the attackers deciphering [19].…”

Section: Key Sensitivitymentioning

confidence: 99%

“…The color cipher image forms after steps of DNA encoding and scrambling. In Ref [19], an Image cryptosystem based on plain image correlation rate and selective chaotic maps is proposed. In this paper, according to the average absolute value of the correlation coefficient of the plain image, Logistic or Tent maps are selected to generate chaotic sequences to expand the plain image matrix.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An efficient image cryptosystem based on the residue number system and hybrid chaotic maps

Kari¹,

Ghomian

2023

Preprint

Self Cite

View full text Add to dashboard Cite

This paper presents a new method for encrypting gray-scale digital images. The proposed method uses a combination of the residue number system and chaotic maps to avoid the complexities of high-dimensional chaotic maps and improve the security of encryption and processing speed. In this method, the image pixel coordinates confusion operation is performed by Arnold's cat map, and the pixel content diffusion step is performed in two phases. In the first phase, the contents of the image pixels are converted to the introduced {(r-1)a, rb, (r + 1)c} residue number system and stored in a matrix. At the same time, a chaotic system produces a combination of Sinusoidal and Logistic maps of chaotic sequences, and after quantization, they are converted into the introduced residue number system and stored in another matrix of the same size. In the second phase of diffusion, XOR operation is performed between these two matrices. The implementation results show that the use of the residue number system, in addition to improving the evaluation parameters, improves the processing time, and the average processing time for encryption is 0.15 seconds. Also, the uniform histogram, the entropy of about 8, and the correlation coefficient close to 0 of the encrypted images all demonstrate the high security of the proposed method.

show abstract

Section: Resistance To Differential Attacksmentioning

confidence: 92%

Section: Key Sensitivitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation