# New classes of reversible cellular automata

DevFeed: [New classes of reversible cellular automata](<https://devfeed.tech/articles/new-classes-of-reversible-cellular-automata-113968.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2411.00721>)

Author: Jan Kristian Haugland, Tron Omland

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [boolean](<https://devfeed.tech/tags/boolean.md>), [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [classification](<https://devfeed.tech/tags/classification.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [cryptanalysis](<https://devfeed.tech/tags/cryptanalysis.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dm](<https://devfeed.tech/tags/cs-dm.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [math-co](<https://devfeed.tech/tags/math-co.md>), [math-ds](<https://devfeed.tech/tags/math-ds.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [open-problems](<https://devfeed.tech/tags/open-problems.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

## AI overview

The paper constructs new classes of reversible cellular automata by composing landscape functions that induce proper liftings of Boolean functions. It examines their cryptographic potential using indicators for differential and linear cryptanalysis, and combines theoretical and computational methods to classify proper liftings completely for diameters up to 6. The abstract also identifies open problems and conjectures; it does not specify the results of the cryptographic analyses.

## Source excerpt

arXiv:2411.00721v2 Announce Type: replace-cross Abstract: Cellular automata find applications in cryptography, error correction, theoretical computer science, and the simulation of physical and biological processes. We say that a Boolean function is a proper lifting if its induced cellular automaton is reversible. This paper introduces new classes of proper liftings, constructed through compositions of landscape functions, and explores their cryptographic potential by computing indicators relevant to differential and linear cryptanalysis. We combine theoretical and computational methods to obtain a complete classification of proper liftings for diameters up to $6$. Several open problems and conjectures are posed along the way.