The Research And Application Of The Fast Construction Of Hamilton Array Codes

With the development of the communication technology and the Internet, information security becomes the most important for its secretive, unanimous and undeniable in storage, exchange and usage.In terms of the difference between encryption key and decryption key, it can be divided into symmetry cryptogram and public key cryptogram, and symmetry can be further divided into block cipher and stream cipher. Because of the development of the computer hardware and the technology of attack, many normal ciphers are attacked. New constructions of the code, especially the ciphers design, have become an important direction of our studies. In the paper, we construct the pseudorandom generator based on the Hamilton array code and stream cipher after researching the theory of the Hamilton array code and the technology of the encrypt. It can improve the ciphers' ability of resisting to many attacks if we use it to replace the key schedule algorithm of the ciphers.This paper researches on the fast algorithm of Hamilton Array Codes for High Dimension and Big Hamming distance and key schedule algorithm based on Hamilton Array Codes. Main contributions of this thesis are as follows: firstly, describe the theory of the Hamilton Array Codes and its general construction. Secondly, we construct and program the fast algorithm of Hamilton Array Codes for High Dimension and Big Hamming distance. Thirdly, we discussion the design principle of the symmetry ciphers. Lastly, we design a key schedule algorithm helped by LFSR and Hamilton Array Codes.The innovation of the thesis is given bellow:First: construct and program the fast algorithm of Hamilton Array Codes for High Dimension and Big Hamming distance.Second: design a key schedule algorithm helped by LFSR and Hamilton Array Codes.