Based On The Fpga Data Encryption Information Transmission Reliability Research In The System

Information technology has greatly accelerated the global informatizationprocess and affected on people’s lives greatly. And the security of datatransmission has become more and more important. As a new subject, people paymore and more attentions in these years. Information security involves twoquestions: the first one is security. Due to the information may be wiretapped bythe third one during the transmission, we must encryption the information toprevent this phenomena.Data encryption is one of the main methods to preventcrytograph from being wiretaped. The second one is the integrity of the data. Itensures that they are not modified during the transmission in the network.Shannon theorem is one of the most important theoretical foundations forinformation theory subjects. It supplies a calculation formula of the maxinformation transmission rates for the channel. Firstly, this paper describes thebasic concepts of cryptography and information theory, and then expounds theclassical encryption and modern encryption.We use the symmetric encryption anddesign the A5/1key stream on FPGA. Secondly, we explain the theory of thechannel coding and demonstrate it’s feasible on FPGA, introduce the encoding anddecoding theory of hamming code and CRC and realize it on FPGA, and thenintroduce the EDA knowledges and its’ design process. We expound the design ofdata encryption system in details and apply the channel coding into the encryptionsystem to enhance the reliability of the system. At last, we show the testingprocess of messages and file transmission. Paper also shows the basic theory ofhash algorithms of SHA-1and MD5. We prove from Birthday Paradox that it canbe used as the authentication system and realize it on FPGA.We design the message authentication system based on hashing algorithms. The paper putforward a new solution for the information secret transmission in the encryptionsystem, which has certain innovation significance.