System for generating, verifying and mixing digital signatures of p-element domain SM2 elliptic curves

Abstract

The invention relates to a system for generating, verifying and mixing digital signatures of p-element domain SM2 elliptic curves. The system functions through the following steps: m' which is obtained by combining a message (m) to be signed with a signer hash value (ZA) is sent to a password hash module; r which is obtained through r=(e+x1)mod n is sent to an s generation module; when r=0, r+k=n or s=0, a random number generation module is notified to regenerate k; r and s are used as signature control centers for output of the digital signature of m; password hash computation is performed to m' to generate the password hash module of the combined message hash value e; the random number generation module of the random number k is generated; k doubling computation is performed to the base G of an elliptic curve; the generated coordinate (x1,y1) is used as the doubling computation module of the result [k]G; and the s generation module is generated according to s=[(1+dA)<-1>*(k-r*dA)] mod n, where n is the order of the elliptic curve, and dA is the private key of the signer. According to the invention, the digital signature algorithm in the SM2 elliptic curve public-key algorithm can be achieved through hardware.

Description

technical field [0001] The invention relates to the technical field of information security, in particular to a digital signature generation, verification and mixing system of a p-element domain SM2 elliptic curve. Background technique [0002] With the development of communication technology and information processing technology, more and more attention has been paid to the security of information in the transmission process. It is necessary to use information processing technology to ensure that information is not eavesdropped, tampered and counterfeited during the communication process. Cryptography can solve this requirement very well. [0003] Since Diffie and Hellmann proposed the concept of public key cryptosystems in 1976, there have been three types of recognized safe and effective public key cryptosystems, which depend on the mathematical problems of integer factorization problem (IFP) and discrete logarithm problem (DLP). ) and elliptic curve discrete logarithm p...

AI Technical Summary

Problems solved by technology

However, what the State Cryptography Administration has announced is only the flow of the SM2 elliptic curve public-key cryptographic algorithm. At present, there has not been any hardware device that implements it in hardware, and it is difficult to put this excellent algorithm into practice.

Images