A chaos-based symmetric image encryption scheme using a bit-level permutation

Zhu, Zhiliang; Zhang, Wei; Wong, Kwok-Wo; Yu, Hai

doi:10.1016/j.ins.2010.11.009

Cited by 608 publications

(294 citation statements)

References 26 publications

Supporting

Mentioning

293

Contrasting

Unclassified

Order By: Relevance

“…Usually, the matrix satisfies the uniform distribution in the interval [ , ] a b or obeys the standard normal distribution with the mean and variance of  and 2  respectively. In the practice of encryption, the dimension of the key matrix depends on the size of the unencrypted image.…”

Section: Key Stream Generation and Image Sequences Encryption Key Strmentioning

confidence: 99%

“…It can be selected as the other key parameter. 2 P is the final encrypted gray image.  Based on the formulas (5) and (6), the decrypted image can be easily obtained.…”

Section: Encryption and Decryption Algorithmmentioning

confidence: 99%

“…Guan et al [1] suggested a hybrid algorithm using a chaotic sequences. Zhu et al [2] used the diffused transformation of the sequences to encrypt the given image. Tong and Cui [3] proposed a composite chaotic encryption method based on cycling shift operations and sequences encryption.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Pixels Sequences Encryption of Image Based on Random Matrixes and Element-by-element Matrix Operations in MATLAB

Liang¹,

Zhu²

2017

dtcse

View full text Add to dashboard Cite

Abstract. Both the random matrixes generated by MATLAB and the element-by-element matrix operations in MATLAB are proposed to construct the pixels sequences encryption algorithm of Images. The random matrixes which obey the uniform distribution or normal distribution are used to generate the key stream. By running the element-by-element matrix multiplication and division between the pixels matrix and the key matrix, the sequences of pixels are encrypted and decrypted. This algorithm shows such advantages as good security, simple calculation, and easy availability for programming. Furthermore, the feasibility and stability of the algorithm are demonstrated by experiments.

show abstract

Section: Key Stream Generation and Image Sequences Encryption Key Strmentioning

confidence: 99%

“…It can be selected as the other key parameter. 2 P is the final encrypted gray image.  Based on the formulas (5) and (6), the decrypted image can be easily obtained.…”

Section: Encryption and Decryption Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Pixels Sequences Encryption of Image Based on Random Matrixes and Element-by-element Matrix Operations in MATLAB

Liang¹,

Zhu²

2017

dtcse

View full text Add to dashboard Cite

show abstract

“…Lenna image. Therefore, we perform fair comparisons between the proposed LSIC and peer methods [6], [14], [15], [16], [17], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54]. in three following aspects:…”

Section: A Experiments Settings and Datasetmentioning

confidence: 99%

Design of image cipher using latin squares

Zhou²,

Noonan

et al. 2014

Information Sciences

167

View full text Add to dashboard Cite

In this paper, we introduce a symmetric-key Latin square image cipher (LSIC) for grayscale and color images. Our contributions to the image encryption community include 1) we develop new Latin square image encryption primitives including Latin Square Whitening, Latin Square S-box and Latin Square P-box ; 2) we provide a new way of integrating probabilistic encryption in image encryption by embedding random noise in the least significant image bit-plane; and 3) we construct LSIC with these Latin square image encryption primitives all on one keyed Latin square in a new loom-like substitution-permutation network. Consequently, the proposed LSIC achieve many desired properties of a secure cipher including a large key space, high key sensitivities, uniformly distributed ciphertext, excellent confusion and diffusion properties, semantically secure, and robustness against channel noise. Theoretical analysis show that the LSIC has good resistance to many attack models including brute-force attacks, ciphertext-only attacks, known-plaintext attacks and chosen-plaintext attacks. Experimental analysis under extensive simulation results using the complete USC-SIPI Miscellaneous image dataset demonstrate that LSIC outperforms or reach state of the art suggested by many peer algorithms. All these analysis and results demonstrate that the LSIC is very suitable for digital image encryption. Finally, we open source the LSIC MATLAB code under webpage https://sites.google.com/site/tuftsyuewu/source-code.

show abstract

“…Since each bit of a pixel contains different percentage of the pixel information, the situation of performing confusion at bit-level is quite different from pixel-level case. The bit-level permutation not only relocates the pixel positions, but also alters the pixel gray values [21,22]. Therefore certain diffusion effect has been introduced in the confusion stage with a bit-level permutation.…”

Section: Introductionmentioning

confidence: 99%