Hybrid cellular automata as pseudo-random number generators with binary synchronization property

This paper introduces random number generators based on hybrid cellular automata (HCA). It is shown that by properly mixing CA cells from two categories (two different rules) an automaton generating near maximal length pseudo-random sequences can be easily obtained. The resulting system is similar to the well-known linear feedback shift register (LFSR) but in addition it posses the binary synchronization property that makes it a valuable ingredient for many applications.