High-speed pseudorandom sequence generators based on cellular automata
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 32-34
Voir la notice de l'article provenant de la source Math-Net.Ru
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},
publisher = {mathdoc},
number = {12},
year = {2010},
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/