A DIGITAL SIGNATURE SCHEME BASED ON THE DIVISION ALGORITHM AND THE DISCRETE LOGARITHM PROBLEM

摘要

A method of creating a secure digital signature comprising the followingsteps: (a) a sender,based on a private key K and message x, calculates a unique pair of integers qand r such thatint(K) = int(h)q + r, then chooses a cyclic group G with generator g, forwhich the discretelogarithm problem is a hard problem and computes the public key g int(K), andcalculates a pair(g q,g r), which is the digital signature of x; (b) a receiver, who knows apublic key g int(K),obtains a message y and a digital signature in a form of pair (g q,g r) andcalculates thefollowing two expressions g int(K)(g r)-1 and (g q)int(y); and (c) thealgorithm generates "TRUE",if the two expressions match, and "FALSE", if they do not.