2-by-n hybrid cellular automata with regular configuration: theory and application

A Novel Algorithm for Image Encryption Based on Weighted and p-interval CA

“…(1) is logical operation OR, c i,j (t+1) is the cell c i,j (t) in next state, c(t)=[c i,j-1 c i,j+1 c i,j c i-1,j c i+1,j ] is the vector of cell c i,j (t) and its neighborhood cells at t time, and w n =[w 1 w 2 w 3 w 4 w 5 ] is the vector mapping the rules of evolution [11] [12]. Both c(t) and w n only have the value 0 or 1.Obviously, the same expression of Eq.…”

Additive Cellular Automata

“…These are the simplest cellular automata, characterized by the property that the action of the update rule on the sum of two states is equal to the sum of the rule acting on each state separately. Hybrid additive rules (i. e., with different cells evolving according to different additive rules) have proved particularly useful for generation of pseudorandom and pseudoexhaustive sequences, signature analysis, and other circuit design applications, e. g. [52,71,72].…”

A Transformation Sequencing Approach to Pseudorandom Number Generation

“…Figure 1 shows a 4-bit CA -an array of four binary registers where each register's new state ( 1) t k s + is computed by a transformation function k Φ over a neighborhood of three nearest registers' current states, In previously published CA PRNG works [7,8,[11][12][13][14][15][16][17][18], authors have generally focused on a particular objective(s) from the full set of desirable PRNG properties. In [7,8,11,12], the focus is on analytical techniques to configure the set of Other researchers [13][14][15][16][17][18] hypothesized that by making structural changes to the CA, the 3 randomness quality of the generated sequences…”

“…These include changing the connection structure or type of neighborhood to draw inputs [3,16,18] from, dimensionality of CA [12,13], the individual transformation function used for each register [2,14,15,17], etc.…”