Maximal length cellular automata in GF(q) and pseudo-random number generation

被引:0
|
作者
Adak, Sumit [1 ]
Bhattacharjee, Kamalika [1 ]
Das, Sukanta [1 ]
机构
[1] Indian Inst Engn Sci & Technol, Dept Informat Technol, Howrah 711103, W Bengal, India
来源
关键词
Pseudo-random number generator (PRNG); cellular automata (CAs); maximal length CA; primitive polynomial; linear rule; Diehard; PRIMITIVE POLYNOMIALS;
D O I
10.1142/S0129183120500370
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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 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 q 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.
引用
收藏
页数:21
相关论文
共 50 条