Reversibility of Symmetric Linear Cellular Automata with Radius <i>r</i> = 3

Abstract

The aim of this work is to completely solve the reversibility problem for symmetric linear cellular automata with radius r = 3 and null boundary conditions. The main result obtained is the explicit computation of the local transition functions of the inverse cellular automata. This allows introduction of possible and interesting applications in digital image encryption.

Keywords

• linear cellular automata
• reversibility
• symmetric rules