Pseudo-random sequence generation using the CNN universal machine with applications to cryptography
暂无分享,去创建一个
[1] Terry Ritter. The Efficient Generation of Cryptographic Confusion Sequences , 1991, Cryptologia.
[2] Leon O. Chua,et al. The CNN paradigm , 1993 .
[3] Stephen Wolfram,et al. Universality and complexity in cellular automata , 1983 .
[4] Tommaso Toffoli,et al. Cellular Automata Machines , 1987, Complex Syst..
[5] N. Margolus. Physics-like models of computation☆ , 1984 .
[6] Leon O. Chua,et al. The CNN Universal Machine is as universal as a Turing Machine , 1996 .
[7] Tamás Roska,et al. The CNN universal machine: an analogic array computer , 1993 .
[8] Z Burda,et al. Classification of networks of automata by dynamical mean-field theory , 1990 .
[9] Parimal Pal Chaudhuri,et al. Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.
[10] S. Wolfram,et al. Two-dimensional cellular automata , 1985 .
[11] S. Wolfram. Random sequence generation by cellular automata , 1986 .
[12] Willi Meier,et al. Analysis of Pseudo Random Sequence Generated by Cellular Automata , 1991, EUROCRYPT.