Encryption Algorithm Based On Cellular Automata And Applications

In the last ten years, with the development of information technique and computer, the higher request has been required to the safety of information. Ensuring the safety of information in all kinds of network activity becomes one of the focus of society. In the process of investigating new method of the cryptography realization, we find many characteristics of cellular automata, such as simplicity of structure, inherent parallelism, capacity of complex computations and dynamic speciality, which can make it satisfy the modern information technique development to the request of multi-layer information safety, as the most hopeful technique in the aspect of technical independence of password, cellular automata will become hot point of research gradually.According to the circumstance of the development of cellular automata, this paper put forward a kind of new neighbor model of cellular automata, the cell space of the model is constituted by some cell spaces of one-dimension cellular automata, thus these make it not only have the complicated structure of two-dimension cellular automata, but also have the complications of compute which is near to in the one dimension cellular automata. Then, construct a pseudo-random number generator on the foundation of this model, the pseudo-random number generator synthesized to use controllable technique and method of hybrid cellular automata. The quantity of pseudo-random number which is generated by the pseudo-random number generator is higher than the quantity of other pseudo-random number generated by the general linear congruential generator and shift-register generator. It can attain the level of two dimension cellular automata, but the computing complication is small in two dimension cellular automata.At the same time, a symmetrical cryptographic algorithm has been constructed based on hybrid inverse cellular automata in this paper. The algorithm uses the iterative mode of hybrid cellular automata and inverse rules, combined with the new cellular automata model it is been used for completing the encryption to the cent set of the data in the symmetrical encryption system. The algorithm can raise key space without increasing the system complexity and the operation quantities, and because of inserting random number in iterative process, the holdout ability of algorithm has been strengthened to cryptograph attack.