Elementary Cellular Automata as Non-Cryptographic Hash Functions
Daniel McKinley
256个基本蜂窝自动机(ECA)中有10个子集作为哈希函数实现,使用在包裹的4x4社区单元上运行的错误最小化有损压缩算法。 所有256条规则都经过处理,在8个子集的两个子集中的10条规则被发现具有包括错误最小化和最大化,唯一解决方案,有损逆,高效追溯哈希和边缘检测应用程序的属性。 该算法与Fast Fourier Transform和Fast Walsh-Hadamard Transform的嵌套式结构并行,该结构在Java中实现,并且构建为哈希任何2字节RGB代码位图。
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 struc...