Research And Implement Of Encrypted Algorithm Based On FPGA

Security issues play an important role in almost all modern communication and computer networks. As Internet applications continue to grow dramatically ,security requirements have to be strengthened. The most three public-key cryptosystems today are RSA, Diffie-Hellman and elliptic curve cryptography (ECC). Hyperelliptic curve cryptography (HECC) is one kind cryptography system which is more difficult to be broken than ECC and HECC allow for shorter operands at the same level of security than ECC. At present, the theory of HECC is already basically mature, but because HECC's computation complexity is very great, it needs more research in implement. The implement of HECC will have great theory significances and application values for enhancing the information systems security and researching the more powerful cryptography and HECC will have more applications.Now, we hope the cryptography can use less space and less time but get stronger security. To complete this objective, the paper researchs the encrypted algorithms of HECC which are realized and compared and proposes an idea that realizing the HECC by soft-hard-coordinate.The paper first introduces two core operation based on finite field algorithms in HECC which are finite field multiplication operation and finite field inversion operation. The realization of serial arithmetic and serial-parallel arithmetic of finite field multiplication operation based on FPGA by VHDL is introduced and then the results are compared. The emphasis is comparing the different bit parallel mixed field multiplication algorithm and finding the best condition which can use less time and less area to realize the algorithm. Through the realization and comparing of these algorithms, we find that the coordination of 8-bit parallel mixed field multiplier is not very good in reality though it seems better in theory. At last, we get the conclusion that the coordination of 4-bit parallel mixed field multiplier is the best in the four experiments. Then three algorithms of finite field inversion are realized and compared based on FPGA by VHDL. From the result, we find that MIMA is better when someone wants to realize finite field inversion algorithms only and the inversion algorithm realized by field multiplication is better when someone wants to combine the finite field multiplication operation and finite field inversion operation and it also make a foundation for the idea which realizing the HECC by soft-hard-coordinate.Then the paper proposes an idea that realizing the HECC by soft-hard-coordinate and put the HECC into soft and hard two parts. This paper puts the scalar multiplication algorithms, divisor algorithms and polynomial ring algorithms into soft part and analyzes the scalar multiplication algorithm particularly. At the same time puts the finite field algorithms into hard part and introduces the hard part simply. At last, we summarize the whole paper and propose the next work.