The Research Of Short Signature Based On Bilinear Pairings

Digital signature is a simulation of physical signature.By a single function we get a series of character string which can prove the message source and if it has been modified. Digital signature is one of the key techniques of information security, which can prove authentication, integrity and non-repudiation. With the development of the network, the electronic security is taken more and more attention and has been widely used in e-commerce and e-government.Considering short signatures has the characteristics of shorter length of the signature, safer and more effective,this paper studies the algorithm to optimize the short signature, design and its application problems.The following results are obtained.First,considering the significance of short signatures in bilinear pairing calculation ,this paper has studied pairings calculation using x-Coordinates only .And combining the property of self-pairing that Pis equal to Q in e( P,Q) ,it optimized the algorithm of self-pairings calculation using x-Coordinates only.The new algorithm requires less finite field operation than the former and so is more efficiently .Comparing with the former algorithm of bilinear pairing,the new algorithm improve the efficiency about 40%.Secondly, considering the open source library PBC provides the finite field operation and bilinear paring calculation ,this paper has used PBC library to implement the short -signature of BLS and ZSS by simulation in Visual C++ 6.0 platform.Lastly, This paper has studied on the database Penetration test and the procedure of Penetration test.Then I implemented Microsoft SQL Server Penetration and SQL injection by stimulation by using the x-Scan,NBSI software.