Signature method based on sm2 algorithm

Abstract

The signature method based on the SM2 algorithm of the present invention includes the following steps: S1, the client and the server both generate random subkeys a and b in a power-limited manner, calculate the inverse elements of a and b for interactive processing, form a constant v, and calculate and output the public Key P. S2. The client generates e according to the original text M to be signed, and at the same time randomly generates DH interaction k11, and transmits e and k11 to the server. S3. The server randomly generates a DH interaction k22 and sends it to the client. The client and the server negotiate a temporary key k, and then the client generates a partial signature Q2. S4. The client transmits Q2 to the server, and the server calculates r and s synchronously, and finally outputs the signature value [r, s]. The invention avoids the risk of signature overflow caused by too large private key, further simplifies the algorithm, and improves the operation efficiency.

Description

technical field [0001] The invention relates to a signature method based on SM2 algorithm. Background technique [0002] Digital signature is to generate a series of symbols and codes through some cryptographic operations to form electronic passwords to sign, instead of writing signatures or seals. Technical verification can also be carried out for such electronic signatures. The accuracy of verification is the same as that of general manual signatures and The verification of the stamp is incomparable. Digital signature is currently the most widely used, most mature and operable electronic signature method in e-commerce and e-government affairs. [0003] In order to improve the security of digital signatures, signature algorithms are gradually developed in the direction of less interaction, reducing the number of transmission parameters, and gradually improving the processing efficiency of algorithms. [0004] The Chinese invention patent with the application publication n...

AI Technical Summary

Problems solved by technology

However, both the first communication party and the second communication party generate a sub-private key with a length between [1, n-1], the product of which may be greater than n, and the private key will be greater than n-2 in actual operations, resulting in excessive private keys. Large risk of signature overflow

Moreover, the calculation process in the signature calculation process is relatively cumbersome, and additional conditions are required for processing. In the signature output process, multiple network interaction calculations are also required, which reduces the calculation efficiency.

Images