| 摘要 |
A method of creating a secure digital signature comprising the following steps: (a) a sender, based on a private key K and message x, calculates a unique pair of integers q and r such that int(K) = int(h)q + r, then chooses a cyclic group G with generator g, for which the discrete logarithm problem is a hard problem and computes the public key g int(K), an d calculates a pair (g q,g r), which is the digital signature of x; (b) a receiver, who knows a public key g int(K), obtains a message y and a digital signature in a form of pair (g q,g r) and calculates the following two expressions g int(K)(g r)-1 and (g q)int(y); and (c) the algorithm generates "TRUE", if the two expressions match, and "FALSE", if they do not.
|
