2009
DOI: 10.1007/978-3-642-00982-2_27
|View full text |Cite
|
Sign up to set email alerts
|

A Cryptosystem Based on the Composition of Reversible Cellular Automata

Abstract: Abstract. We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We conclude with a discussion on security and practical consid… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…Cellular automata have long been used for construction of cryptographic primitives [7][8][13][14][15][16][17][18][19][20][21]. Frequently, the elementary one-dimensional cellular automata are used for generation of binary pseudo-random sequences, which have decent statistical characteristics [14][15][16][17][18][19].…”
Section: A Cellular Automata In Cryptographic Transformationsmentioning
confidence: 99%
“…Cellular automata have long been used for construction of cryptographic primitives [7][8][13][14][15][16][17][18][19][20][21]. Frequently, the elementary one-dimensional cellular automata are used for generation of binary pseudo-random sequences, which have decent statistical characteristics [14][15][16][17][18][19].…”
Section: A Cellular Automata In Cryptographic Transformationsmentioning
confidence: 99%
“…If the same rule applies to all cells in a CA, the CA is named uniform or regular CA, whereas if different rules apply to different cells, it is The CA was used as a pseudorandom numbers generator to produce statistically good sequences used to cipher plain data by the Vernam ciphering model. CAs were also used for blockciphers constructions using reversible and irreversible rules [17], and also to build public-key cryptosystems by exploiting two-dimensional CAs reversibility problem [18].…”
Section: Cellular Automata Preliminariesmentioning
confidence: 99%
“…Security in socio-cyberphysical systems must be ensured using post-quantum algorithms, as well as lightweight encryption algorithms that can be used in low-energy elements of socio-cyberphysical systems. Thus, the problem of cybersecurity is also an integral third component in solving the problem of ensuring the security of banking information [13][14][15][16]. Thus, an urgent problem is the need for a new approach to building information security systems that will ensure the required level of SCPS security (CIF) in the post-quantum period.…”
Section: Introductionmentioning
confidence: 99%