| 摘要 |
<p>A signing device, a verifying device, a certifying device, an encrypting device, and a decrypting device for efficiently reducing the signature text forgery problem to a discrete logarithm problem. A commitment is a set of hash values including committed values. As a public key, data including the original pair of the cyclic groups relating to a discrete logarithm problem is used. A secret key, a discrete logarithm of the order of the pair is used. Consequently, secret information on an attacker can be summarized from the commitment without rewinding the attacker, and the safety can be ensured better than the Schnorr signing method. Modulo exponentiation is performed once for each of signing and verifying. Thus, the computational complex of signature verifying computation can be reduced.</p> |
