RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive

Prikl. Diskr. Mat. Suppl., 2017 Issue 10, Pages 76–81 (Mi pdma322)

This article is cited 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.

UDC: 519.7

DOI: 10.17223/2226308X/10/32



© Steklov Math. Inst. of RAS, 2025