Improved elliptic curve digital signature algorithm and signature verification method thereof

Abstract

The invention discloses an improved elliptic curve digital signature algorithm. Before identity identification, a signature side and a signature verification side obtains a time random number t from a trusted third party. The improved elliptic curve digital signature algorithm comprises: step one, a k belonging to [1, n-1] is selected randomly; step two, operation of kP=(x1,y1) is carried out and then the x1 is converted into an integer; step three, calculation is carried out based on a formula: r=x1mod n, wherein if the r is equal zero, the step one is carried out again and a random time number t is obtained from the trusted third party; step four, a formula e=H(m) is calculated, wherein the H(x) express a hash function; step five, calculation is carried out based on a formula: s=k<-1>t(e+dr)mod n, and if the s is equal to zero, the step one is carried out again and a random time number t is obtained from the trusted third party; and step six, a signature pair (r,s) is outputted. In addition, the invention also discloses a signature verification method based on the improved elliptic curve digital signature algorithm. Therefore, a behavior of signature countering by an intermediary can be avoided.

Description

technical field [0001] The invention relates to the field of information security, in particular to an improved Elliptic Curve Digital Signature Algorithm (ECDSA). The invention also relates to a signature verification method based on the improved elliptic curve digital signature algorithm. Background technique [0002] 1. Introduction to Elliptic Curve Digital Signature Algorithm [0003] Digital signature corresponds to the digitization of handwritten signature, which can provide data source authentication, data integrity and non-repudiation. Elliptic Curve Digital Signature Algorithm is the elliptic curve version of digital signature. The specific process of ECDSA is as follows: [0004] Input parameter group D=(q, FR, S, a, b, P, n, h), private key d, message m. [0005] Output the signature pair (r, s). [0006] a. Randomly select k ∈ [1, n-1]; [0007] b. Operation kP=(x 1 ,y 1 ), then put x 1 converted to an integer; [0008] c. Calculate r=x 1 mod n, if r=...

AI Technical Summary

Problems solved by technology

[0021] 2. Mafia scam

[0024] Therefore, if the digital signature is improved and the digital signature is introduced into the time parameter, then when Alice digitally signs Bob's bill, and Bob passes Alice's digital signature to Carol, Alice's digital signature is already invalid, so the black hand The party will not be able to carry out the scam

[0025] The original ECDSA signature can be reused, and when the time factor is introduced, the ECDSA signature cannot be reused by others

Images