A family of fast keystream generators based on programmable linear cellular automata over GF (q) and time-variant table

Abstract

A novel family of keystream generators is proposed employing a linear cellular automata over GF (q) with timevarying transition rule. The analysis indicates that the generator, which is the general member of the family, reaches standard minimal security conditions (large period and good statistical properties) and that it is secure" against all known attacks. An important feature of the proposed generators is that they are compact and suitable for high speed applications.