The use of linear hybrid cellular automata as pseudorandom bit generators in cryptography

Abstract

The main goal of this paper is to study the behaviour of a particular type of hybrid cellular automata, as cryptographically secure pseudorandom bit generators. The hybrid cellular automata considered have been passed the statistical tests defined in the cryptographic literature to study the security of the sequences generated for cryptographic purposes: frequency test, serial test, poker test, run test and autocorrelation test. Moreover, a study of their dynamical behaviour have been done.