A Parallel Encryption Algorithm for Block Ciphers Based on Reversible Programmable Cellular Automata
Debasis Das, Abhishek Ray

TL;DR
This paper introduces a new parallel block encryption algorithm based on reversible programmable cellular automata, leveraging CA's inherent parallelism for cryptographic applications.
Contribution
The paper proposes a novel symmetric key encryption algorithm utilizing reversible programmable cellular automata, enhancing cryptographic efficiency and security.
Findings
Demonstrates the algorithm's parallel processing capabilities.
Shows improved encryption speed over traditional methods.
Validates security features through theoretical analysis.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Chaos-based Image/Signal Encryption · DNA and Biological Computing
