Point-to-point elliptic-curve type digital signature algorithm and signature verification method based on the same

Abstract

The invention discloses an improved point-to-point elliptic-curve type digital signature algorithm. The algorithm comprises the following steps that: (1), a formula t=Hash(IDA||IDB||count)mod n is calculated, wherein the count is equal to 0X00000001; and if t is equal to 0, the count++ is realized and the t is calculated again; (2), k belonging to [1, n-1] is selected randomly; (3), a formula kP=(x1,y1) is operated and the x1 is transformed into an integer; (4), a formula r=x1 mod n is calculated; and if the r is equal to 0, the step (2) is carried out again; (5), an expression e=H(m) is calculated, wherein the H(x) is a hash function; (6), an expression s=k <1>t (e+dr) mod n is calculated; if the s is equal to 0, the step (2) is carried out again to obtain a random number; and (7), a signature pair (r,s) is outputted. In addition, the invention also discloses a signature verification method based on the improved point-to-point elliptic-curve type digital signature algorithm. A point-to-point signature verification behavior is realized.

Description

technical field [0001] The invention relates to the field of information security, in particular to a point-to-point 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 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=0...

AI Technical Summary

Problems solved by technology

[0025] The technical problem to be solved by the present invention is to provide a point-to-point elliptic curve digital signature algorithm, which can effectively solve the problem of point-to-point signature; at the same time, compared with the traditional elliptic curve signature method, it is guaranteed that man-in-the-middle attacks cannot be realized on other node IDs

Images