Behaviors of Single Attractor Cellular Automata over Galois Field GF (2 p )

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we analyze behaviors of state transitions of a linear Single Attractor Cellular Automata(SACA) C and the complemented SACA C′ derived from C over Galois Field GF(2 p ). And we propose the algorithm for the construction of the state transition diagram of C and C′ over GF(2 p ) by using the new concept of basic path. These results extend the results over GF(2) of Cho et al. for SACA.