Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MP_1998_a7,
author = {Yu. V. Nesterenko},
title = {{\CYRA}{\cyrl}{\cyrg}{\cyro}{\cyrr}{\cyri}{\cyrt}{\cyrm}{\cyri}{\cyrch}{\cyre}{\cyrs}{\cyrk}{\cyri}{\cyre} {\cyrp}{\cyrr}{\cyro}{\cyrb}{\cyrl}{\cyre}{\cyrm}{\cyrery} {\cyrt}{\cyre}{\cyro}{\cyrr}{\cyri}{\cyri} {\cyrch}{\cyri}{\cyrs}{\cyre}{\cyrl}},
journal = {Matematicheskoe Prosveshchenie},
pages = {87--114},
publisher = {mathdoc},
year = {1998},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MP_1998_a7/}
}
Yu. V. Nesterenko. Алгоритмические проблемы теории чисел. Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (1998), pp. 87-114. http://geodesic.mathdoc.fr/item/MP_1998_a7/
[1] Yaschenko V. V., “Osnovnye ponyatiya kriptografii”, Matematicheskoe prosveschenie. Ser. 3, no. 2, 1998, 53–70
[2] Rivest R. L., Shamir A., Adleman L., “A method for obtaining digital signatures and public key cryptosystems”, Commun. ACM, 21:2 (1978), 120–126 | DOI | MR | Zbl
[3] Gardner M., “A new kind of cipher that would take millions of years to break”, Sci. Amer., 1977, 120–124
[4] Vinogradov I. M., Osnovy teorii chisel, Nauka, M., 1972 | MR
[5] Karatsuba A. A., Osnovy analiticheskoi teorii chisel, Nauka, M., 1983 | MR
[6] Atkins D., Graff M., Lenstra A. K. and Leyland P. C., The magic words are squeamish ossifrage, ASIACRYPT-94, Lect. Notes in Comput. Sci., 917, Springer, 1995 | MR | Zbl
[7] Knut D., Iskusstvo programmirovaniya na EVM. T. 2: Poluchislennye algoritmy, Mir, M., 1977 | Zbl
[8] Akho A., Khopkroft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, M., 1979 | MR | Zbl
[9] Varnovskii N. P., “Kriptografiya i teoriya slozhnosti”, Matematicheskoe prosveschenie. Ser. 3, no. 2, 1998, 71–86
[10] Williams H. C., “Primality testing on a computer”, Ars Combin., 5 (1978), 127–185 ; Kiberneticheskii sbornik, no. 23, 1986, 51–99 | MR | Zbl
[11] Vasilenko O. N., “Sovremennye sposoby proverki prostoty chisel”, Kiberneticheskii sbornik, no. 25, 1988, 162–188 | MR | Zbl
[12] Alford W. R., Granville A., Pomerance C., “There are infinitely many Carmichael numbers”, Ann. Math., 139:3 (1994), 703–722 | DOI | MR | Zbl
[13] Prakhar K., Raspredelenie prostykh chisel, Mir, M., 1967 | MR
[14] Plaisted D. A., “Fast verification, testing, and generation of large primes”, Theor. Comp. Sci., 9 (1979), 1–16 | DOI | MR | Zbl
[15] Adleman L. M., Pomerance C., Rumely R. S., “On distinguishing prime numbers from composite numbers”, Annals of Math., 117 (1983), 173–206 | DOI | MR | Zbl
[16] Lenstra H. W. (jr.), “Primality testing algorithms (after Adleman, Rumely and Williams)”, Lecture Notes in Math., 901, 1981, 243–257 | MR | Zbl
[17] Cohen H., Lenstra H. W. (jr.), “Primality testing and Jacobi sums”, Math. of Comput., 42:165 (1984), 297–330 | DOI | MR | Zbl
[18] Riesel H., Prime numbers and computer methods for factorization, Birkhäuser, 1985 | MR | Zbl
[19] Cohen H., A course in computational algebraic number theory, Graduate-Texts in Math., 138, Springer, New York, 1993 | MR | Zbl
[20] Coppersmith D., Odlyzko A. M., Schroeppel R., “Discrete logarithms in $GF(p)$”, Algorithmica, 1 (1986), 1–15 | DOI | MR | Zbl
[21] McCurley K. S., “The discrete logarithm problem”, Proc. of Symp. in Appl. Math., 42 (1990), 49–74 | MR | Zbl
[22] Lenstra A. K., Lenstra H. W., Manasse M. S., Pollard J. M., “The number field sieve”, Proc. 22nd Ann. ACM Symp. on Theory of Computing (Baltimore, May 14–16, 1990), 564–572
[23] Lenstra H. W. (jr.), “Elliptic curves and number-theoretic algorithms”, ICM86, 99–120 ; Mezhdunarodnyi kongress matematikov v Berkli, Mir, M., 1991, 164–193 | MR | Zbl
[24] Koblitz N., A Course in Number Theory and Cryptography, 2nd ed., Springer, 1994 | MR | Zbl
[25] Lenstra A. K., Lenstra H. W. (jr.), The Development of the Number Field Sieve, Lect. Notes in Math., 1554, Springer, 1993 | MR
[26] Ben-Or M., “Probabilistic algorithms in finite fields”, Proc. 22 IEEE Symp. Found. Comp. Sci., 1981, 394–398