| 摘要 |
The invention relates to a cryptography process with public key, based on the discrete logarithm and implying the calculation of the magnitude r = g<k> modp, wherein p is an integer called modulus, and k is a random number. According to the invention, a data base comprising the couples (xi, g<xi> modp) is formed, the xi being pseudo-random values and said values are used in a linear combination in order to obtain an exponent k, the calculation of the magnitude g<k> modp being done by using the g<x>i entering in the combination. Application to the digital signature or to the authentication.
|
