Maximal Length Cellular Automata in GF(q) and Pseudo-random Number Generation

This work explores the randomness quality of maximal length cellular automata (CAs) in GF(q), where q≥2. A greedy strategy is chosen to select the candidate CAs which satisfy unpredictability crite...