|
Lines 25 and 26 generate ephemeral keys for signatures. The 26 line means k·G, which means that addOperation is performed k times.Line 27 stores the x value of the ephemeral generated public key in r. Lines 30 through 33 are the process of hashing messages to sign them. The message here is a transaction. Lines 35 through 37 represent the last line of the signing logic of the previous slide.Starting with Line 48, the verification process is a code representation. Line 48 obtains an inverse source of s and stores it in w. Lines 49 and 50 are codes that obtain the values u1 and u2 required for the verification procedure. Lines 51 and 52 perform the u1·G, u2·Q operations necessary for verification. The following operations correspond to those used by generatePubKey.In line 53, the x and y values are obtained through operations. If this x value matches the previously obtained r value, this signature is a valid signature. |