Evolving cellular automata to generate nonlinear sequences with desirable properties
暂无分享,去创建一个
[1] Albert Y. Zomaya,et al. Cellular automata computations and secret key cryptography , 2004, Parallel Comput..
[2] Palash Sarkar,et al. Cryptographically significant Boolean functions with five valued Walsh spectra , 2002, Theor. Comput. Sci..
[3] Kishalay Mitra,et al. Modeling the recrystallization process using inverse cellular automata and genetic algorithms: Studies using differential evolution , 2005 .
[4] William Millan,et al. Efficient Algorithms for Analysis of Cryptographic Boolean Functions , 2002 .
[5] Santanu Chattopadhyay,et al. Additive cellular automata : theory and applications , 1997 .
[6] Steven Guan,et al. An evolutionary approach to the design of controllable cellular automata structure for random number generation , 2003, IEEE Trans. Evol. Comput..
[7] John A. Clark,et al. Two-Stage Optimisation in the Design of Boolean Functions , 2000, ACISP.
[8] Ian C. Parmee,et al. Preferences and their application in evolutionary multiobjective optimization , 2002, IEEE Trans. Evol. Comput..
[9] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[10] Shujian Zhang,et al. Minimal cost one-dimensional linear hybrid cellular automata of degree through 500 , 1995, J. Electron. Test..
[11] Nirupam Chakraborti,et al. Simulating recrystallization through cellular automata and genetic algorithms , 2005 .
[12] Marco Tomassini,et al. Cryptography with cellular automata , 2001, Appl. Soft Comput..