Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDM_2010_2_a4, author = {B. M. Sukhinin}, title = {High-speed pseudorandom sequence generators based on cellular automata}, journal = {Prikladna\^a diskretna\^a matematika}, pages = {34--41}, publisher = {mathdoc}, number = {2}, year = {2010}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDM_2010_2_a4/} }
B. M. Sukhinin. High-speed pseudorandom sequence generators based on cellular automata. Prikladnaâ diskretnaâ matematika, no. 2 (2010), pp. 34-41. http://geodesic.mathdoc.fr/item/PDM_2010_2_a4/
[1] Farmer D., Toffoli T., Wolfram S., “Preface to Cellular Automata”, Proceedings of an Interdisciplinary Workshop, Los Alamos, New Mexico, 1984, vii–xii | MR
[2] Toffoli T., Margolus N., Mashiny kletochnykh avtomatov, Mir, M., 1991, 280 pp.
[3] Wolfram S., A New Kind of Science, Wolfram Media, 2002, 1192 pp. | MR | Zbl
[4] Wolfram S., “Cellular Automata”, Los Alamos Science, 1983, no. 9, 2–21
[5] Wolfram S., “Cryptography with Cellular Automata”, Proceedings of CRYPTO'85, 1986, 429–432
[6] Feistel H., “Cryptography and Computer Privacy”, Scientific American, 228:5 (1973), 15–23 | DOI
[7] 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-rev1/SP800-22rev1.pdf