Maximal length cellular automata in GF(q) and pseudo-random number generation
2020 ◽
Vol 31
(03)
◽
pp. 2050037
Keyword(s):
This work explores the randomness quality of maximal length cellular automata (CAs) in GF([Formula: see text]), where [Formula: see text]. A greedy strategy is chosen to select the candidate CAs which satisfy unpredictability criterion essential for a good pseudo-random number generator (PRNG). Then, performance of these CAs as PRNGs is empirically analyzed by using Diehard battery of tests. It is observed that, up to GF(11), increase in [Formula: see text] improves randomness quality of the CAs, but after that, it saturates. Finally, we propose an implementable design of a good PRNG based on a 13-cell maximal length cellular automaton over GF(11) which can compete with the existing well-known PRNGs.
2017 ◽
Vol 28
(06)
◽
pp. 1750078
◽
2014 ◽
Vol 4
(6)
◽
pp. 28-33
◽
2020 ◽
Vol 8
(6)
◽
pp. 5741-5748
1979 ◽
Vol C-28
(9)
◽
pp. 637-642
◽
2013 ◽
Vol 39
(4)
◽
pp. 1367-1379
◽
2016 ◽
Vol 10
(11)
◽
pp. 109-118
◽