Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences

2004 ◽  
pp. 31-39 ◽  
Author(s):  
Sung-Jin Cho ◽  
Un-Sook Choi ◽  
Yoon-Hee Hwang ◽  
Han-Doo Kim ◽  
Yong-Soo Pyo ◽  
...  
Keyword(s):  
Cellular Automata ◽  
Phase Shifts ◽  
Maximum Length

Maximum-length sequences, cellular automata, and random numbers

1987 ◽  
Vol 71 (2) ◽  
pp. 391-428 ◽  
Author(s):  
A Compagner ◽  
A Hoogland
Keyword(s):  
Cellular Automata ◽  
Maximum Length ◽  
Random Numbers

Color image encryption based on programmable complemented maximum length cellular automata and generalized 3-D chaotic cat map

2020 ◽  
Vol 79 (31-32) ◽  
pp. 22825-22842
Author(s):  
Un Sook Choi ◽  
Sung Jin Cho ◽  
Jin Gyoung Kim ◽  
Sung Won Kang ◽  
Han Doo Kim
Keyword(s):  
Cellular Automata ◽  
Image Encryption ◽  
Color Image ◽  
Maximum Length ◽  
Color Image Encryption

Video Image Encryption Technique Using Maximum-Length Cellular Automata and Arnold’s Cat Map

2015 ◽  
Vol 764-765 ◽  
pp. 992-996
Author(s):  
Arum Sulgi Cho ◽  
Xiao Wei Li ◽  
Sung Jin Cho ◽  
Seok Tae Kim
Keyword(s):  
Cellular Automata ◽  
Image Encryption ◽  
Video Image ◽  
Maximum Length ◽  
Experimental Results ◽  
Arnold Transform ◽  
High Security ◽  
Xor Operation ◽  
Arnold’S Cat Map ◽  
Encryption Method

In this paper, we propose a video image encryption approach by using maximum length cellular automata (MLCA) methods. First, the plane images of video of the encryption method are obtained by dividing frame units. Then the XOR operation and Arnold transform are applied to each of RGB plane images. Lastly, the encryption image is encrypted by the basis image of MLCA. To demonstrate the usefulness of the proposed method, we carry out preliminary experiments and present the experimental results. The experimental results show that the proposed method provides high security.

scholarly journals LAYERED CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION

2007 ◽  
Vol 18 (02) ◽  
pp. 217-234
Author(s):  
SYN KIAT TAN ◽  
SHENG-UEI GUAN
Keyword(s):  
Cellular Automata ◽  
Linear Function ◽  
Phase Difference ◽  
Linear Complexity ◽  
Maximum Length ◽  
Operating Speed ◽  
Time Varying ◽  
Nonlinear Functions ◽  
Initial States ◽  
Pseudorandom Number Generation

The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set {Af | f = 1, 2, …, 2n -1} formed by the transformation matrix A of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L = 1, 2, 3, 4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions f30 and f45 in place of the linear function f204 used in the L-LCA. Linear complexity is significantly increased when f30 or f45 is used.

scholarly journals A TRANSFORMATION SEQUENCING APPROACH TO PSEUDORANDOM NUMBER GENERATION

2007 ◽  
Vol 18 (08) ◽  
pp. 1293-1302
Author(s):  
SYN KIAT TAN ◽  
SHENG-UEI GUAN
Keyword(s):  
Cellular Automata ◽  
Uniform Distribution ◽  
Design Patterns ◽  
Maximum Length ◽  
Pseudorandom Number ◽  
New Approach ◽  
Balanced Distribution ◽  
Pseudorandom Number Generation ◽  
Important Design ◽  
Randomness Tests

This paper presents a new approach to designing pseudorandom number generators based on cellular automata. Current cellular automata designs either focus on (i) ensuring desirable sequence properties such as maximum length period, balanced distribution of bits and uniform distribution of n-bit tuples, etc. or (ii) ensuring the generated sequences pass stringent randomness tests. In this work, important design patterns are first identified from the latter approach and then incorporated into cellular automata such that the desirable sequence properties are preserved like in the former approach. Preliminary experiment results show that the new cellular automata designed have potential in passing all DIEHARD tests.

scholarly journals Complemented Maximum-Length Cellular Automata Applied on Video Encryption

2017 ◽  
Vol 17 (1) ◽  
pp. 13-18
Author(s):  
Gao-Yong Li ◽  
◽  
Sung-Jin Cho ◽  
Seok-Tae Kim
Keyword(s):  
Cellular Automata ◽  
Maximum Length ◽  
Video Encryption
Sign in / Sign up

Export Citation Format

Share Document