Procedure of public key cryptography based on the discrete logarithm.

摘要

Process public key cryptography based on the discrete logarithm during which a calculation of a magnitude r = gk modp is performed, where p is a prime number called modulus, k is a random number and g an integer called base, the method comprises the following steps consisting in: - forming a database containing m random data x 0, ..., xm - 1 ym corresponding powers z0, ..., zm - 1 such as, for any i, zi = g xi mod p, - generating the random exponent k by performing the following substeps: generating m values ​​* a0, ..., am - 1, among which only w randomly chosen values ​​among the m values ​​are not zero, * k calculating operating a random linear combination of random data from the database according to the relation: (See formula) - and calculating gk mod p combining the powers corresponding to the random data, among the m values ​​xi that are part of the combination.