|
Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 32–34
(Mi pdm227)
|
|
|
|
Mathematical Methods of Cryptography
High-speed pseudorandom sequence generators based on cellular automata
B. M. Sukhinin N. E. Bauman Moscow State Technical University, Moscow
Abstract:
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.
Citation:
B. M. Sukhinin, “High-speed pseudorandom sequence generators based on cellular automata”, Prikl. Diskr. Mat., 2010, supplement № 3, 32–34
Linking options:
https://www.mathnet.ru/eng/pdm227 https://www.mathnet.ru/eng/pdm/y2010/i12/p32
|
Statistics & downloads: |
Abstract page: | 176 | Full-text PDF : | 78 | References: | 38 |
|