Ten elementary cellular automata rules, found by exhaustive search, are used in a 4x4 error-scoring scheme claimed to give unique, evenly distributed, partially invertible hashes, with the proof of uniqueness left as an assertion.
Fast walsh–algorithmcode.hadamard transform — Wikipedia, the free encyclopedia, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
nlin.CG 1years
2025 1verdicts
REJECT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Elementary Cellular Automata as Non-Cryptographic Hash Functions
Ten elementary cellular automata rules, found by exhaustive search, are used in a 4x4 error-scoring scheme claimed to give unique, evenly distributed, partially invertible hashes, with the proof of uniqueness left as an assertion.