You are here: Home :: Area NEM :: Mathematics

D. V. Matyukhin

On asymptotic complexity of computing discrete logarithms over GF(p)

We analyse the modification of an algorithm for finding discrete logarithms over the field GF(p) (p is a prime number) which has been described by the author previously. It is shown that this modification gives the best estimate at the present time of the complexity of finding discrete logarithms over finite prime fields which coincides with the best known estimate of the complexity of factoring integers obtained by D. Coppersmith.

Discrete Mathematics and Applications, Walter de Gruyter

Print ISSN: 0924-9266
Volume: 13, 05/2003
Pages: 27 - 50

Show full article (external site)

Show all available items of this journal

 

Area NEM