Synchronization of cellular automaton pairs

Urı́as, Jesús; Salazar, Gelasio; Ugalde, Edgardo

doi:10.1063/1.166367

Cited by 21 publications

(14 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Ref. [6] it was shown that a pair of ECAs that evolve using the local rule 90, synchronize if the coupled coordinates are separated by a block of N = 2 n -1 decoupled sites, where n is a positive integer. Based on the phenomenon of synchronization, in Ref.…”

Section: Cellular Automatamentioning

confidence: 99%

Image Encryption System Based on Cellular Automata and S-Box

Contreras¹,

Ramírez²,

Aboytes³

2019

RCS

View full text Add to dashboard Cite

This investigation presents an image encryption system and its security analysis, it is based on cellular automata and a substitution box. The joint of these two techniques, allow to encrypt digital images with a high adjacent redundancy and pass different statistical and differential tests and cryptanalytic attacks. The synchronization phenomenon of cellular automata, is sensitive to initial conditions, therefore has been used in Pseudo Random Number Generators (PRNG) and cryptosystems. In this system, the synchronization phenomenon is used to change the coefficients of the pixels, but the process is not equal for each bit, thus the s-box is used to make the system robust and for compliance with the bit independence criterion among others.

show abstract

Section: Cellular Automatamentioning

confidence: 99%

Image Encryption System Based on Cellular Automata and S-Box

Contreras¹,

Ramírez²,

Aboytes³

2019

RCS

View full text Add to dashboard Cite

show abstract

“…In this work is considered the encryption scheme used in [9], where the synchronization phenomenon of cellular automata has been applied to design two families of permutations Ψ and Φ, and an asymptotically perfect pseudo-random number generator. This cryptosystem is flexible and reconfigurable for different bit-lengths.…”

Section: Encryption System Escamentioning

confidence: 99%

“…The encryption system considered in this implementation is based on the synchronization of the cellular automaton rule 90 [9]. This cryptosystem is named ESCA (for short) and it has been validated and implemented for image encryption in [6,7].…”

Section: Introductionmentioning

confidence: 99%

A Secure Compression Scheme for Real-time Applications Using 2D-WT and Cellular Automata

Ramírez-Torres¹,

Murguı́a²,

Carlos³

et al. 2015

RCS

View full text Add to dashboard Cite

In this work is presented a numerical implementation of a system that combines a compression scheme with an improved encryption procedure, which is applied to digital images. For the compression stage is considered the two-dimensional Haar wavelet transform, where an energy criterion is contemplated. On the other hand, the encryption scheme regarded is based on the synchronization of the cellular automaton rule 90, this system presents a good performance to encrypt images and it is resistant to cryptanalysis attacks such as the Chosen/Known-plaintext attack. The numerical conjunction of these procedures could be an appealing option for real-time applications such as video communications, video-surveillance among others.

show abstract

“…The strength of coupling is handled by means of a probability, and numerical evidence in several examples supports the existence of a critical value of the probability above which the pair synchronizes identically. The other form is a deterministic coupling as was done in [10]. Therein, necessary and sufficient conditions for synchronization of coupled affine elementary cellular automata were given.…”

mentioning

confidence: 99%

“…Therein, necessary and sufficient conditions for synchronization of coupled affine elementary cellular automata were given. The proof in [10] is based on the existence of a connection between synchronization and nilpotency of matrices. The natural generalization of that approach led us to the study of the nilpotency of a broader class of matrices.…”

mentioning

confidence: 99%

Master--slave synchronization of affine cellular automaton pairs

Salaza

Ugalde

Urı́as

2005

Discrete &Amp; Continuous Dynamical Systems - A

Self Cite

View full text Add to dashboard Cite

Necessary and sufficient conditions are given for master-slave synchronization of any pair of unidirectionally coupled one-dimensional affine cellular automata of rank one. In each case the synchronization condition is expressed in terms of the coupling and the arithmetic properties of the automaton local rule. The asymptotic behavior of finite length affine automata of rank one, subjected to Dirichlet boundary conditions, is shown to be equivalent to the synchronization problem.

show abstract

Synchronization of cellular automaton pairs

Cited by 21 publications

References 7 publications

Image Encryption System Based on Cellular Automata and S-Box

Image Encryption System Based on Cellular Automata and S-Box

A Secure Compression Scheme for Real-time Applications Using 2D-WT and Cellular Automata

Master--slave synchronization of affine cellular automaton pairs

Contact Info

Product

Resources

About