Research And Application Of Cellular Automata

Cryptography is the kernel of the secure communication and informationsecurity. In the exploration of the self-dependent techniques of the cryptography, the Cellular Automata (CA) is viewed as the most potential of the kernel technique in the self-dependent techniques of the cryptography by its simple,regular and high parallel processing architecture which is suitable of VLSI implementation and its complicated dynamic properties. These make it more suitablefor the applications in cryptography, and it becomes the most potential of the kernel technique in the independent research of the cryptography.This paper makes a study of the cycle and the security of cellular automata, the way how to design HASH Functions based on cellular automata. Firstly, it gives an introduction to some basic knowledge in cellular automata; Secondly,a cellular automata with a nesting structure on pseudo-random sequence and HASH function is designed;Lastly,an idea of cellular automata likely is discussed.Several valuable and important results which bring forth new ideas are achieved and listed as follows:1. As an imagination, The cellular automata with a nesting structure and cellular automata likely are discussed. The study demonstrates that the relationship of cells is more in the cellular automata with a nesting structure and the programmable CA is a good way for cellular automata likely.2. The cellular automata with a nesting structure and two models of cellular automata likely are strdied from the equation of the cellular automata with input. Simulation demonstrates that all cellular automatas are easily implemented, and can generate high speed bit sequence with long period and excellent statistical properties. Specially, the linear complexity has been improved highly.3. Based upon the character of chaos and the cellular automata with a nesting structure, we bring up a model of HASH function.