High-speed pseudorandom sequence generators based on cellular automata
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 32-34
We investigate a number of properties of uniform two-dimensional boolean cellular automata and propose a new method for pseudorandom sequences generation based on such automata. Generated sequences show good statistical properties. Moreover, hardware implementation of proposed methods on a typical FPGA has very high performance of up to 25 Gbps at 100 MHz frequency.
@article{PDM_2010_12_a14,
author = {B. M. Sukhinin},
title = {High-speed pseudorandom sequence generators based on cellular automata},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {32--34},
year = {2010},
number = {12},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a14/}
}
B. M. Sukhinin. High-speed pseudorandom sequence generators based on cellular automata. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 32-34. http://geodesic.mathdoc.fr/item/PDM_2010_12_a14/
[1] Farmer D., Toffoli T., Wolfram S., “Preface to Cellular Automata”, Proceedings of an Interdisciplinary Workshop, 1984, vii–xii | MR
[2] Feistel H., “Cryptography and Computer Privacy”, Scientific American, 228:5 (1973), 15–23 | DOI
[3] NIST SP 800-22. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, revision 1, http://csrc.nist.gov/publications/nistpubs/800-22-rev1a/SP800-22rev1a.pdf