pith. sign in

arxiv: 1006.2822 · v1 · submitted 2010-06-14 · 💻 cs.CR

A Parallel Encryption Algorithm for Block Ciphers Based on Reversible Programmable Cellular Automata

Debasis Das , Abhishek Ray This is my paper
classification 💻 cs.CR
keywords automatacellularalgorithmblockcellciphersclassencryption
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity

    cs.CC 2019-07 unverdicted novelty 4.0

    Introduces polynomial-complexity algorithms to compute reversibility period and verify reversibility for general 1D linear CA, with a generation method from given periods.