2 ms·

> cellular automata-based PRNGs for stream ciphers This is something that kind of died in the late 80s. One of the most noteworthy cases was Damgard's CA-base

by pbsd 13y ago

> cellular automata-based PRNGs for stream ciphers This is something that kind of died in the late 80s. One of the most noteworthy cases was Damgard's CA-based hash function in the paper that proved collision-resistance of the Merkle-Damgard mode [1]. It was quickly broken [2]. The SHA-3 winner, Keccak, has roots in CA-based designs [3], but at this point it's little more than an historical footnote. [1] http://www.inf.usi.ch/faculty/shrimpton/spring09/damgard89.pdf http://www.inf.usi.ch/faculty/shrimpton/spring09/damgard89.p... [2] http://www.cosic.esat.kuleuven.be/publications/article-132.pdf http://www.cosic.esat.kuleuven.be/publications/article-132.p... [3] http://ice.mat.dtu.dk/slides/KeccakIcebreak-slides.pdf http://ice.mat.dtu.dk/slides/KeccakIcebreak-slides.pdf

taliesinb 13y ago
For 2, I think it was overly ambitious to think that within a program family so small it has only 88 members there would be one ideal hash function. And If you compare the simplicity of Damgard's design to the contortions that modern hash designs employ to stymy cryptanalysis, it's hard to think that more designs constructions wouldn't perform better, even on that particular automaton. For 3, I think having a full 7 slides of Bertoni et al's slide deck devoted to the influence of CA-based cryptography on SHA-3 makes it fair to call the approach influential. Thanks for the references!