Introduces polynomial-complexity algorithms to compute reversibility period and verify reversibility for general 1D linear CA, with a generation method from given periods.
A Parallel Encryption Algorithm for Block Ciphers Based on Reversible Programmable Cellular Automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
A Cellular Automata (CA) is a computing model of complex System using simple rule. In CA the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbours' to the simple rule. Cellular Automata are highly parallel and discrete dynamical systems, whose behaviour is completely specified in terms of a local relation. This paper deals with the Cellular Automata (CA) in cryptography for a class of Block Ciphers through a new block encryption algorithm based on Reversible Programmable Cellular Automata Theory. The proposed algorithm belongs to the class of symmetric key systems.
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity
Introduces polynomial-complexity algorithms to compute reversibility period and verify reversibility for general 1D linear CA, with a generation method from given periods.