Pseudorandom number generation based on nongroup cellular automata

The orbits of quadratic functions in GF(2/sup n/) presents cycles of maximal length 2/sup n-l/-2. The characterization of the coefficient b allows the generation of such sequences for every n/spl ges/4. A pseudorandom sequence generator based on these functions is developed by means of a nongroup hybrid additive cellular automata. A simpler nongroup CA can replace the original CA derived from the quadratic function defined by the usual rules 90 and 150.