Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Riesel H., “Some soluble cases of the discrete logarithm problem”, BIT, 28:4 (1988), 839–851 | DOI | MR | Zbl
[2] Cohen H., Advanced topics in computational number theory, Springer, New York, 2000 | MR | Zbl
[3] Hess F., Pauli S., Pohst M. E., “Computing the multiplicative group of residue class rings”, Math. Comp., 72 (2003), 1531–1548 | DOI | MR | Zbl
[4] Popovyan I. A., “Pod'em resheniya pokazatelnogo sravneniya”, Matem. zametki, 80:1 (2006), 76–86 | MR | Zbl
[5] Nesterenko Yu. V., “Chastnye Ferma i $p$-adicheskie logarifmy”, Trudy po diskretnoi matematike, 5 (2002), 173–188
[6] Cherepnev M. A., “O nekotorom svoistve diskretnogo logarifma”, Tezisy dokl. XII mezhdunarodnoi konf. “Problemy teoreticheskoi kibernetiki”, Nizhnii Novgorod, 1999
[7] Borevich Z. I., Shafarevich I. R., Teoriya chisel, Nauka, Moskva, 1964 | MR