ECDSA method for resisting error curve attack

Abstract

The invention discloses an ECDSA (Elliptic Curve Digital Signature Algorithm) method for resisting error curve attack, comprising the following steps: S1, randomly selecting k belonging to (1, n-1); S2, taking a random point R of an elliptic curve, and calculating M=R+kP; S3, calculating M-R=(x1,y1), and converting x1 into an integer; S4, calculating r=x1 mod n, and jumping back to S1 if r=0; S5, calculating e=H(m), wherein H(x) is a Hash function; S6, calculating s=k<1>(e+dr) mod n, and jumping back to S1 if s=0; and S7, outputting a signature pair (r, s). According to the invention, attackers can be effectively prevented from getting the private keys of users through error curve attack in the ECDSA.

Description

technical field [0001] The invention relates to the field of information security, in particular to an ECDSA (Elliptic Curve Digital Signature Algorithm) method for resisting error curve attacks. Background technique [0002] A theoretical introduction to the Elliptic Curve Digital Signature Algorithm (ECDSA). 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: [0003] Input parameter group D=(q, FR, S, a, b, P, n, h), private key d, message m. Among them, q is the order of the domain, FR is the representation of the domain, S is the seed, a, b are the parameters of the elliptic curve, P is the base point, n is the order of the point P, and h is the cofactor. [0004] Output the signature pair (r, s). [0005] Step 1. Randomly ...

AI Technical Summary

Problems solved by technology

The usual defense against the attack on the wrong curve is to check whether the point P is on the original safe elliptic curve, but the checking calculation is generally made into a function in engineering, so that the attacker may skip this step of checking by injecting burrs into the chip

In order to ensure the safety of the chip, it is necessary to check the calculation many times during the operation process, but too many checks will greatly sacrifice the operating efficiency of the chip

[0018] Therefore, if the operation point multiplied by kP is improved, after P is attacked, the attacker cannot get the correct error point product result, then the error curve attack will not succeed

Images