Elementary Cellular Automata as Non-Cryptographic Hash Functions

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: McKinley, Daniel
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909641579954176
author McKinley, Daniel
author_facet McKinley, Daniel
contents A subset of 10 of the 256 elementary cellular automata (ECA) are implemented as a hash function using an error minimization lossy compression algorithm operating on wrapped 4x4 neighborhood cells. All 256 rules are processed and 10 rules in two subsets of 8 are found to have properties that include both error minimization and maximization, unique solutions, a lossy inverse, efficient retroactive hashing, and an application to edge detection. The algorithm parallels the nested powers-of-two structure of the Fast Fourier Transform and Fast Walsh-Hadamard Transform, is implemented in Java, and is built to hash any 2 byte RGB code bitmap.
format Preprint
id arxiv_https___arxiv_org_abs_2506_06551
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Elementary Cellular Automata as Non-Cryptographic Hash Functions
McKinley, Daniel
Cellular Automata and Lattice Gases
Formal Languages and Automata Theory
A subset of 10 of the 256 elementary cellular automata (ECA) are implemented as a hash function using an error minimization lossy compression algorithm operating on wrapped 4x4 neighborhood cells. All 256 rules are processed and 10 rules in two subsets of 8 are found to have properties that include both error minimization and maximization, unique solutions, a lossy inverse, efficient retroactive hashing, and an application to edge detection. The algorithm parallels the nested powers-of-two structure of the Fast Fourier Transform and Fast Walsh-Hadamard Transform, is implemented in Java, and is built to hash any 2 byte RGB code bitmap.
title Elementary Cellular Automata as Non-Cryptographic Hash Functions
topic Cellular Automata and Lattice Gases
Formal Languages and Automata Theory
url https://arxiv.org/abs/2506.06551