Discrete logarithm problem in subgroups of prime order
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 87-90
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The abilities of known algorithms to solve the discrete logarithm problem in subgroups of prime order are discussed. The Adleman's method modification is proposed and its correctness is stated.
[1] Menezes A. J., Van Oorshot P. C., Vanstone S. A., Handbook of Applied Cryptography, Series on Discrete Mathematics and Its Applications, CRC Press, N.Y., 1997 | MR | Zbl
[2] Belov A. G., “Issledovanie algoritma diskretnogo logarifmirovaniya Adlemana”, Vestnik Tomskogo gosuniversiteta. Prilozhenie, 2005, no. 14, 45–49