2008Prikladnaya diskretnaya matematika PrilozhenieRequires access

Криптосистемы клеточных автоматов

Росошек Семён Константинович, Боровков Сергей Иванович, Евсютин Олег Олегович

Open publisher page 0 citations

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

About this research paper

What this paper is about

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

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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

Key concepts: Block cellular automaton, Continuous automaton, Cellular automaton, Cryptosystem, Reversible cellular automaton, Elementary cellular automaton, Deterministic automaton, Asynchronous cellular automaton

Back to paper searchBrowse research topicsOriginal source
Криптосистемы клеточных автоматов — Research Paper | ScholarLens