Architecture of Image Encryption Hardware Using Two Dimensional Cellular Automata

Cellular automata (CA) are simple models of computation which exhibit fascinatingly complex behavior. Due to the universality of CA model, it has been widely applied in traditional cryptography and image processing. The aim of this paper is to present a new image encryption scheme based on balanced two-dimensional cellular automata. In this scheme, a random image with the same size of the plain image to be encrypted is first generated by a pseudo-random number generator with a seed. Then, the random image is evoluted alternately with two balanced two-dimensional CA rules. At last, the cipher image is obtained by operating bitwise XOR on the final evolution image and the plain image. This proposed scheme possesses some advantages such as very large key space, high randomness, complex cryptographic structure, and pretty fast encryption/decryption speed. Simulation results obtained from some classical images at the USC-SIPI database demonstrate the strong performance of the proposed image encryption scheme.

Download Full-text

Reversible cellular automata image encryption for similarity search

Signal Processing Image Communication ◽

10.1016/j.image.2018.12.008 ◽

2019 ◽

Vol 72 ◽

pp. 134-147 ◽

Cited By ~ 8

Author(s):

Yingri Su ◽

Yan Wo ◽

Guoqiang Han

Keyword(s):

Cellular Automata ◽

Image Encryption ◽

Similarity Search ◽

Reversible Cellular Automata

Download Full-text

A STUDY OF BIFURCATIONS IN A CIRCULAR REAL CELLULAR AUTOMATON

International Journal of Bifurcation and Chaos ◽

10.1142/s0218127493000234 ◽

1993 ◽

Vol 03 (02) ◽

pp. 293-321 ◽

Cited By ~ 1

Author(s):

JÜRGEN WEITKÄMPER

Keyword(s):

Hopf Bifurcation ◽

Dynamical Systems ◽

Cellular Automata ◽

Cellular Automaton ◽

Parallel Computers ◽

Discrete Dynamical Systems ◽

Two Dimensional ◽

Bifurcation Structure ◽

Logistic Mapping ◽

Henon Mapping

Real cellular automata (RCA) are time-discrete dynamical systems on ℝN. Like cellular automata they can be obtained from discretizing partial differential equations. Due to their structure RCA are ideally suited to implementation on parallel computers with a large number of processors. In a way similar to the Hénon mapping, the system we consider here embeds the logistic mapping in a system on ℝN, N>1. But in contrast to the Hénon system an RCA in general is not invertible. We present some results about the bifurcation structure of such systems, mostly restricting ourselves, due to the complexity of the problem, to the two-dimensional case. Among others we observe cascades of cusp bifurcations forming generalized crossroad areas and crossroad areas with the flip curves replaced by Hopf bifurcation curves.

Download Full-text