Voir la notice de l'article provenant de la source Math-Net.Ru
[1] K. Sakurai, H. Shizuya, “Relationships among the computational powers of breaking discrete log cryptosystems”, Advances in cryptology—EUROCRYPT ' 95 (Saint-Malo, 1995), Lecture Notes in Comput. Sci., 921, Springer, Berlin, 1995, 341–355 | MR | Zbl
[2] M. A. Cherepnëv, “O svyazi slozhnostei zadach diskretnogo logarifmirovaniya i Diffi–Khellmana”, Diskr. matem., 8:3 (1996), 22–30 | MR | Zbl
[3] G. H. Hardy, S. Ramanujan, “The normal number of prime factors of a number $n$”, Q. J. Math., 48 (1917), 76–92 | Zbl
[4] P. Turán, “On a theorem of Hardy and Ramanujan”, J. London Math. Soc. (2), 30 (1929), 93–111
[5] P. Erdős, “On the normal number of prime factors of $p-1$ and some related problems concerning Euler's $\varphi$-function”, Q. J. Math. (Oxford), 6 (1935), 205–213 | DOI | Zbl
[6] K. Prakhar, Raspredelenie prostykh chisel, Mir, M., 1967 | MR | Zbl