Image encryption with an improved cryptosystem based on a matrix approach

2014 ◽  
Vol 25 (10) ◽  
pp. 1450054 ◽  
Author(s):  
M. T. Ramírez-Torres ◽  
J. S. Murguía ◽  
M. Mejía Carlos
Keyword(s):  
Cellular Automaton ◽  
Image Encryption ◽  
Digital Technology ◽  
Statistical Tests ◽  
Encryption Scheme ◽  
Matrix Approach ◽  
Plain Text ◽  
Encryption And Decryption ◽  
Random Bit Generator ◽  
Main Components

This paper carries out the image encryption with a revised and modified cryptosystem based on a rule-90 cellular automaton. For this purpose, we used an appropriate and convenient matrix approach to implement the main components of the encryption system, two indexed families of permutations and a pseudo-random bit generator. Furthermore, we modify the encryption scheme for improving its security. This makes our encryption proposal resist some common attacks, e.g. chosen plain-text attack, and the encryption and decryption processes are performed in a flexible way. Also, some security aspects of the cryptosystem are evaluated with a series of statistical tests exhibiting good results. It is believed that this proposal fits naturally in the present digital technology and is capable of achieving high levels of performance.

scholarly journals IMPROVEMENT AND ANALYSIS OF A PSEUDO-RANDOM BIT GENERATOR BY MEANS OF CELLULAR AUTOMATA

2010 ◽  
Vol 21 (06) ◽  
pp. 741-756 ◽  
Author(s):  
J. S. MURGUÍA ◽  
M. MEJÍA CARLOS ◽  
H. C. ROSU ◽  
G. FLORES-ERAÑA
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Statistical Tests ◽  
Random Sequences ◽  
Multifractal Formalism ◽  
Random Generator ◽  
Random Bit Generator ◽  
The Matrix ◽  
Randomization Process

In this paper, we implement a revised pseudo-random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix HNwith the aim of calculating the pseudo-random sequences of N bits employing the algorithm related to the automaton backward evolution. In addition, a multifractal structure of the matrix HNis revealed and quantified according to the multifractal formalism. The latter analysis could help to disentangle what kind of automaton rule is used in the randomization process and therefore it could be useful in cryptanalysis. Moreover, the conditions are found under which this pseudo-random generator passes all the statistical tests provided by the National Institute of Standards and Technology (NIST).

scholarly journals A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion

Entropy ◽  
2020 ◽  
Vol 22 (2) ◽  
pp. 180 ◽  
Author(s):  
Dalia H. ElKamchouchi ◽  
Heba G. Mohamed ◽  
Karim H. Moussa
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Secret Key ◽  
Binary Matrix ◽  
Plain Text ◽  
Chaotic Diffusion ◽  
Key Space ◽  
Encryption And Decryption ◽  
Security Standards ◽  
Differential Attacks

Modern multimedia communications technology requirements have raised security standards, which allows for enormous development in security standards. This article presents an innovative symmetric cryptosystem that depends on the hybrid chaotic Lorenz diffusion stage and DNA confusion stage. It involves two identical encryption and decryption algorithms, which simplifies the implementation of transmitting and receiving schemes of images securely as a bijective system. Both schemes utilize two distinctive non-consecutive chaotic diffusion stages and one DNA scrambling stage in between. The generation of the coded secret bit stream employs a hybrid chaotic system, which is employed to encrypt or decrypt the transmitted image and is utilized in the diffusion process to dissipate the redundancy in the original transmitted image statistics. The transmitted image is divided into eight scrambled matrices according to the position of the pixel in every splitting matrix. Each binary matrix is converted using a different conversion rule in the Watson–Crick rules. The DNA confusion stage is applied to increase the complexity of the correlation between the transmitted image and the utilized key. These stages allow the proposed image encryption scheme to be more robust against chosen/known plaintext attacks, differential attacks, cipher image attacks, and information entropy. The system was revealed to be more sensitive against minimal change in the generated secret key. The analysis proves that the system has superior statistical properties, bulkier key space, better plain text sensitivity, and improved key sensitivity compared with former schemes.

scholarly journals Scaling Analysis of an Image Encryption Scheme Based on Chaotic Dynamical Systems

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 672
Author(s):  
L. E. Reyes-López ◽  
J. S. Murguía ◽  
H. González-Aguilar ◽  
M. T. Ramírez-Torres ◽  
M. Mejía-Carlos ◽  
...  
Keyword(s):  
Image Encryption ◽  
Statistical Tests ◽  
Fluctuation Analysis ◽  
Scaling Analysis ◽  
Encryption Scheme ◽  
Complete Evaluation ◽  
Substitution Boxes ◽  
Encrypted Images ◽  
The Impact ◽  
Hyperchaotic Systems

Despite that many image encryption systems based on chaotic or hyperchaotic systems have been proposed to protect different kinds of information, it has been crucial to achieve as much security as possible in such systems. In this sense, we numerically implement a known image encryption system with some variants, making special emphasis when two operations are considered in the scrambling stage. The variants of such an encryption system are based on some hyperchaotic systems, which generated some substitution boxes and the keys of the system. With the aim to have a more complete evaluation, some internal stages of the image encryption scheme have been evaluated by using common statistical tests, and also the scaling behavior of the encrypted images has been calculated by means of a two-dimensional detrended fluctuation analysis (2D-DFA). Our results show that the image encryption systems that include two operations or transformations in the scrambling stage present a better performance than those encryption systems that consider just one operation. In fact, the 2D-DFA approach was more sensitive than some common statistical tests to determine more clearly the impact of multiple operations in the scrambling process, confirming that this scaling method can be used as a perceptual security metric, and it may contribute to having better image encryption systems.

scholarly journals An image encryption scheme employing key related skipping

2018 ◽  
Vol 69 (2) ◽  
pp. 93-105 ◽  
Author(s):  
Jakub Oravec ◽  
Ján Turán ◽  
L’uboš Ovseník ◽  
Tomáš Huszaník
Keyword(s):  
Phase Space ◽  
Image Encryption ◽  
Statistical Tests ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Encryption Scheme ◽  
Image Pixels ◽  
Encrypted Images ◽  
Image Encryption Algorithm ◽  
Chaotic Logistic Map

Abstract This paper describes an image encryption algorithm which utilizes chaotic logistic map. Values generated by this map are used in two steps of algorithm which shuffles image pixels and then changes their intensities. Design of the encryption scheme considers possibility of various attacks, such as statistical, differential or phase space reconstruction attacks. Robustness against last mentioned type of attacks is introduced by selective skipping of values generated by the map. This skipping depends on key entered by user. The paper also verifies properties of proposed algorithm by common measures and by set of statistical tests that examine randomness of computed encrypted images. Results are compared with other approaches and they are also briefly discussed.

Color Image Encryption Scheme Based on Chaotic Map

2012 ◽  
Vol 182-183 ◽  
pp. 1800-1804
Author(s):  
Jin Qiu ◽  
Ping Wang
Keyword(s):  
Image Encryption ◽  
Stream Cipher ◽  
Color Image ◽  
Statistical Tests ◽  
Chaotic Map ◽  
Linear Feedback ◽  
Encryption Scheme ◽  
Color Image Encryption ◽  
Overall Design ◽  
Feedback Shift Register

In this paper, a chaos-based image encryption scheme with stream cipher structure is proposed. The key component of the encryption system is a pseudo-random bit generator (PRBG) based on a chaotic map and a linear feedback shift register. The proposed PRBG is not only passes the statistical tests, but also improve the security. The overall design of the image encryption scheme is to be explained while detail cryptanalysis is given.

scholarly journals Chaos Based Image Encryption

2018 ◽  
Vol 9 (1) ◽  
pp. 97
Author(s):  
Suresh. G. B ◽  
V. Mathivanan
Keyword(s):  
Image Encryption ◽  
Median Filter ◽  
Experimental Results ◽  
New Method ◽  
Encryption Scheme ◽  
Mapping Algorithm ◽  
Encrypted Image ◽  
High Security ◽  
Encryption And Decryption

<p>New method of secure image encryption and decryption scheme based on the chaos is proposed. There are two steps are followed after the preprocessing step in the proposed system namely, Encryption and Decryption. In preprocessing, images are denoised using median filter. Then the original input images will be encrypted by using the chaos mapping algorithm. At last the original images are retrieved back from the encrypted image by using the key that is specified during the encryption process for the decryption of the original images. Then the histogram mapping is done for the encrypted and the decrypted images. The proposed system is tested on well-known images like Lena, Mandrill, Clown and Barbara. The experimental results have demonstrated that the introduced image encryption scheme can achieve high security for practical image encryption.</p>

scholarly journals Asymmetric image encryption scheme based on Massey Omura scheme

2022 ◽  
Vol 12 (1) ◽  
pp. 1040
Author(s):  
Najlae Falah Hameed Al Saffar ◽  
Inaam R. Al-Saiq ◽  
Rewayda Razaq Mohsin Abo Alsabeh
Keyword(s):  
Image Encryption ◽  
High Resistance ◽  
Signal To Noise Ratio ◽  
Mathematical Problem ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Encryption Scheme ◽  
Signal To Noise ◽  
Encryption And Decryption ◽  
Encryption Schemes

Asymmetric image encryption schemes have shown high resistance against modern cryptanalysis. Massey Omura scheme is one of the popular asymmetric key cryptosystems based on the hard mathematical problem which is discrete logarithm problem. This system is more secure and efficient since there is no exchange of keys during the protocols of encryption and decryption. Thus, this work tried to use this fact to propose a secure asymmetric image encryption scheme. In this scheme the sender and receiver agree on public parameters, then the scheme begin deal with image using Massey Omura scheme to encrypt it by the sender and then decrypted it by the receiver. The proposed scheme tested using peak signal to noise ratio, and unified average changing intensity to prove that it is fast and has high security.

scholarly journals A Novel Image Encryption Scheme Based on Reversible Cellular Automata

2019 ◽  
Vol 1 (1) ◽  
Author(s):  
AliMohammad Latif ◽  
Zeinab Mehrnahad
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Image Encryption ◽  
Experimental Results ◽  
Encryption Scheme ◽  
Encrypted Image ◽  
Reversible Cellular Automaton ◽  
Quantitative Performance ◽  
Image Pixels ◽  
Reversible Cellular Automata

In this paper, a new scheme for image encryption is presented by reversible cellular automata. The presented scheme is applied in three individual steps. Firstly, the image is blocked and the pixels are substituted by a reversible cellular automaton. Then, image pixels are scrambled by an elementary cellular automata and finally the blocks are attached and pixels are substituted by an individual reversible cellular automaton. Due to reversibility of used cellular automata, decryption scheme can reversely be applied. The experimental results show that encrypted image is suitable visually and this scheme has satisfied quantitative performance.

Sign in / Sign up

Export Citation Format

Share Document