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 条
  • [1] FPGA implementations of cellular automata for pseudo-random number generation
    Anghelescu, Petre
    Sofron, Emil
    Ionita, Silviu
    Ionescu, Laurentiu
    [J]. 2006 INTERNATIONAL SEMICONDUCTOR CONFERENCE, VOLS 1 AND 2, 2007, : 371 - +
  • [2] Field programmable gate array implementations of cellular automata for pseudo-random number generation
    Isaacs, JC
    Watkins, RK
    Foo, SY
    [J]. PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 1957 - 1963
  • [3] Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
    Manzoni, Luca
    Mariot, Luca
    [J]. CELLULAR AUTOMATA (ACRI 2018), 2018, 11115 : 428 - 437
  • [4] Non-uniform nonlinear cellular automata with large cycles and their application in pseudo-random number generation
    Mukherjee, Sukanya
    Adak, Sumit
    Bhattacharjee, Kamalika
    Das, Sukanta
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2021, 32 (07):
  • [5] ON SEQUENCES OF PSEUDO-RANDOM NUMBERS OF MAXIMAL LENGTH
    CERTAINE, J
    [J]. JOURNAL OF THE ACM, 1958, 5 (04) : 353 - 356
  • [6] Hybrid Cellular Automata as Pseudo-Random Number Generators with Binary Synchronization Property
    Dogaru, Radu
    [J]. ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS,, 2009, : 389 - 392
  • [7] Evolution of 2-Dimensional Cellular Automata as Pseudo-random Number Generators
    Girau, Bernard
    Vlassopoulos, Nikolaos
    [J]. CELLULAR AUTOMATA, ACRI 2012, 2012, 7495 : 611 - 622
  • [8] A metric for evolving 2-D cellular automata as pseudo-random number generators
    [J]. Vlassopoulos, Nikolaos, 1600, Old City Publishing (09): : 2 - 3
  • [9] A Metric for Evolving 2-D Cellular Automata As Pseudo-Random Number Generators
    Vlassopoulos, Nikolaos
    Girau, Bernard
    [J]. JOURNAL OF CELLULAR AUTOMATA, 2014, 9 (2-3) : 139 - 152
  • [10] PSEUDO-RANDOM NUMBER GENERATOR BASED ON BINARY AND QUINARY MAXIMAL-LENGTH SEQUENCES
    PANGRATZ, H
    WEINRICHTER, H
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1979, 28 (09) : 637 - 642