The Discrete Logarithm Logic Research In The Algorithm Space And The IP Design Of Shank Algorithm

Nowadays, ElGamal public key cipher system is another cipher system comes after RSA public key cipher system, this cipher system is based on the difficulty of solving discrete logarithm. Applications based on the difficulty of discrete logarithm include such fields as key exchange and digital signature, so the research on the area of discrete logarithm is extensive. On one hand, encoding systems based on the difficulty of discrete logarithm in information safety field are investigated, on another hand, algorithms of solving discrete logarithm are widely studied. There are mainly four kinds of different algorithms solving the discrete logarithm: Shank algorithm, Pollard_Hellman algorithm, Pollard p algorithm, and exponent algorithm. Among them, Pollard_Hellman algorithm used to decompose integer, Pollard p algorithm, and exponent algorithm are based on the factorization of great number, while factorization itself is a difficult problem in math. Shark algorithm is a much more fast and resource-saving method in all the algorithms intended to solve discrete logarithm.With the development of integrate circuit technology, the IC scale becomes more and more large and complicated. With the emerging of system on chip(SOC) the electronic industry shows great interest in the reusability of a design. In IC design, the usage of IP resource can shorten the design circle, and also can raise the chance of one-time tape outand can make the function of the system chip even more strong.This paper analyzed the resource requirements of the Shank algorithm. A top-down design flow is chosen, with the the emphasis on reconfigurable logic technology. A optimized IP model is put forward, and then turned into software IP core. At the end of the paper, the results of simulation and verification of the proposed Shank algorithn are presented.