An image encryption based on elementary cellular automata

Jin, Jun

doi:10.1016/j.optlaseng.2012.06.002

Cited by 104 publications

(45 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ELCAs were examined as an alternative ECA based PRNG in data security [24], and CDMA applications [25,36]. In other researches, uses of cycles of length 8 were suggested for encryptions of gray scale images [6, 14,40], thus potential uses of ELCAs of length 8 were argued for image encryption in [25]. In another research, Equal Length Cycle Cellular Automata (ELCCAs) were synthesized as a special case of invertible CAs and were suggested for uses in protein synthesis [11].…”

Section: Comparisons Of Various Solutions For Prngsmentioning

confidence: 99%

On the Selection of Cellular Automata based PRNG in Code Division Multiple Access Communications

Mitra¹

2016

SIC

View full text Add to dashboard Cite

Abstract:The main contribution of this article is to investigate the application suitability of Cellular Automata based pseudo-random noise generator in Code Division Multiple Access Communications. New dynamics in group Cellular Automata were explored. Extensive analysis for two classes of group Cellular Automata (maximum length Cellular Automata and equal length Cellular Automata) were carried out. The analysis and comparison results for these classes of group Cellular Automata demonstrate the advantages of equal length Cellular Automata over maximum length Cellular Automata in view of code division multiple access applications. Keywords: Pseudo-Random Noise Generator, Linear Feed Back Shift Register, Coupled Map Lattice, Cellular Automata, Code Division Multiple Access.example, the discretized CMLs consisting of skew tent maps were defined as [12],where the number of sites is L, z 1, n ∈(0,1) present the state variable (real valued) for the site i at time n (=0,1,...), coupling constant is ε∈(0,1) with skew tent map is as [42],where parameter p ∈(0,1) .Stream cipher generation using CMLs along with computation of largest linear correlations between consecutive key streams, which is below the safe bounds, were introduced in [42]. Equal length tent maps (ELTM) (with analogy to ELCAs) and binary tent maps (BTM) based BIST applications were presented in [34]. The BTM was defined as [34],Stability issues and enhanced pattern formation in CMLs using fuzzy nodes towards information security were put forward in [30]. CfMLs are efficient in processing of uncertainty in information. Necessary conditions for periodicity, conditions for the minimal number of iterations in simulations of CfMLs, and validation of results (for both of CMLs and CfMLs) were discussed in [21]. Chaos-based PRNGs were introduced in many papers, e.g., [8,29]. The drawback for this class of PRNGs is the requirement for digitization for the uses in digital systems.Many PRNGs for BISTs use LFSRs. Multiplepolynomial LFSRs (MP-LFSRs) based PRNGs for BISTs were established in [12]. LFSR-PRNGs aiming reduced circuitry in BISTs were demonstrated in [17]. In an another design, LFSR-PRNGs with self reseeding capacity were shown to produce longer pseudo-random sequences with minimal logic [9]. An example of LFSR-based low-cost BIST architecture with low silicon area overhead was described in [20].CAs (specifically group CAs) were suggested as PRNGs in data security and BISTs applications. [5, 7, 8,13,18,27,37]. A large number of research papers study the chaos dynamics in ECAs [2,15,22,28,39]. PRNG characteristics for the Maximum Length Group CAs (MaxCAs) were explored in details [5, 7, 8] and MaxCAs were suggested as PRNGs in BISTs [5,13,18] and data security applications [5,27].On the other hand, a novel fCA and fCA based PRNGs were recommended in [35] [3] and argued "a strong connection between them by focusing on two properties: density conservation and additivity" [3]. This is one of the reasons why we restricted the study in Section 3-5 to CAs on...

show abstract

Section: Comparisons Of Various Solutions For Prngsmentioning

confidence: 99%

On the Selection of Cellular Automata based PRNG in Code Division Multiple Access Communications

Mitra¹

2016

SIC

View full text Add to dashboard Cite

show abstract

“…It was initially the idea of Steven Wolfram who suggested for the first time the use of CA for cryptography in 1985 [12]. After that, several works are proposed in the scientific literature for image encryption including [13][14][15][16][17][18][19]. A combination of both cellular automata and chaos for designing cryptosystems for image security is also proposed where the use of chaotic map is selected in the permutation phase and cellular automata solely in the diffusion phase [20,21,26,42] or the use of both chaotic map and cellular automata in the diffusion phase [22].…”

Section: Introductionmentioning

confidence: 99%

An image encryption scheme combining chaos-memory cellular automata and weighted histogram

Souyah

Faraoun

2016

Nonlinear Dyn

View full text Add to dashboard Cite

This paper presents a new symmetric scheme for enciphering digital images. The proposal is based on the combination of chaos and cellular automata (CA) under the scenarios of one round enciphering/deciphering and permutation-diffusion architecture. All the generated key-streams in the proposed cryptosystem are based on the use of an improved one-dimensional (1D) chaotic system [i.e., logistictent system (LTS)] with excellent chaotic properties.These key-streams are related to both the secret key and the characteristics of the plain image. Before applying the encryption process, one pixel of the plain image at a random position is overwritten by inserting the weighted histogram value as a new measure to represent the plain image's features, this pixel withholds the encryption routine and further will be used to guarantee the resistance to known/chosen plain image attacks (CPA secure). In the confusion phase, a bit-level permutation is adopted with the generated one-time keystreams using an improved 1D chaotic system. This strategy of shuffling is handled in which besides to the modification of each pixel's position, its value is also changed, to further render the achievement of both confusion and diffusion possible within just this phase. The diffusion phase is divided into two subphases: In the first one, the value of each pixel is changed sequentially by means of an improved one-dimensional chaotic system, to fasten the diffusion process and spread the influence of a single bit over the others, and in the second subphase, two-dimensional reversible memory cellular automata are associated with quadtree decomposition strategy and applied to the output of the first subphase, to enhance both the security and the diffusion effect of the cryptosystem. Security analysis shows the capacity of the proposed scheme to resist the commonly known attacks besides to its competitive speed that traces its suitability for practical image encryption.

show abstract

“…Unfortunately, these algorithms are vulnerable to chosen-plaintext attacks [1,23]. Consequently, many other encryption schemes that are not susceptible to this type of attack have been proposed [3,5,12,13,21].…”

Section: Introductionmentioning

confidence: 99%

A fast ARX model-based image encryption scheme

Choi

Seok

Seo

et al. 2016

Multimed Tools Appl

View full text Add to dashboard Cite

This paper proposes a novel ARX model-based image encryption scheme that uses addition, rotation, and XOR as its confusion and diffusion mechanism instead of S-Box and permutation as in SP networks. The confusion property of the proposed scheme is satisfied by rotation and XOR with chaotic sequences generated from two logistic maps. Unlike classical image encryption schemes that adopt S-Box or permutation of the entire plain image, the diffusion property is satisfied using addition operations. The proposed scheme exhibits good performance on correlation coefficients (horizontal, vertical and diagonal), Shannon's entropy and NPCR (Number of Pixels Change Rate). Furthermore, simulation results indicate that its time complexity is 9.2 times more efficient than the fastest algorithm(Yang's algorithm).

show abstract

An image encryption based on elementary cellular automata

Cited by 104 publications

References 13 publications

On the Selection of Cellular Automata based PRNG in Code Division Multiple Access Communications

On the Selection of Cellular Automata based PRNG in Code Division Multiple Access Communications

An image encryption scheme combining chaos-memory cellular automata and weighted histogram

A fast ARX model-based image encryption scheme

Contact Info

Product

Resources

About