|
Prikladnaya Diskretnaya Matematika, 2008, Number 1(1), Pages 43–49
(Mi pdm9)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Methods of Cryptography
Cellular automaton cryptosystems
S. K. Rososheka, A. A. Borovkovb, O. O. Evsutinb a Tomsk State University
b Tomsk State University of Control Systems and Radioelectronics
Abstract:
The new class of cryptosystems based on reversible cellular automatons is constructed. Full description of two examples of cellular automaton cryptosystems is given: namely cryptosystem based on cellular automaton with Moore neighbor and cryptosystem based on cellular automaton on partitioning. First type cryptosystem uses key for controlling over process of cellular automaton rule change by which every cell computes next state from his neighbors current states. Second type cryptosystem uses key for controlling over cellular automaton on portioning dynamics development, namely for controlling over following parameters: lattice block height, lattice block width, shift size in rule table and step number of cellular automaton development.
Citation:
S. K. Rososhek, A. A. Borovkov, O. O. Evsutin, “Cellular automaton cryptosystems”, Prikl. Diskr. Mat., 2008, no. 1(1), 43–49
Linking options:
https://www.mathnet.ru/eng/pdm9 https://www.mathnet.ru/eng/pdm/y2008/i1/p43
|
Statistics & downloads: |
Abstract page: | 849 | Full-text PDF : | 459 | First page: | 1 |
|