|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Methods of Cryptography
Self-programmable cellular automata for cryptography
A. A. Efremova, A. N. Gamova Saratov State University, Saratov
Abstract:
This report provides an information about self-programmable cellular automata (SPCA) and their implementation. As a result of researching and testing SPCA in practise, it is shown that the cellular automata of this type can be successfully used as the pseudorandom number generators (PRNG) in cryptography. The following techniques are proposed to increase the security of such PRNG: 1) read the cell values in different periods of time; 2) use the cellular programming technique for selection of rules; 3) combine one- and two-dimensional cellular automata; 4) increase the number of cells and the neighbourhood radius.
Keywords:
cellular automata, self-programmable cellular automata, pseudorandom number generator, cryptography.
Citation:
A. A. Efremova, A. N. Gamova, “Self-programmable cellular automata for cryptography”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 76–81
Linking options:
https://www.mathnet.ru/eng/pdma322 https://www.mathnet.ru/eng/pdma/y2017/i10/p76
|
Statistics & downloads: |
Abstract page: | 220 | Full-text PDF : | 118 | References: | 50 |
|