Source: http://nature.web.ru/db/msg.html?mid=1157083&uri=node38.html
Timestamp: 2019-04-23 12:13:09+00:00

Document:
1 Rivest R. L., Shamir A., Adleman L. A method for obtaining digital signatures and public key cryptosystems // Commun. ACM. V.21, No 2, 1978. P. 120-126.
2 Gardner M. A new kind of cipher that would take millions of years to break // Sci. Amer. 1977. P. 120-124.
3 Виноградов И. М. Основы теории чисел. М.: Наука, 1972.
4 Карацуба А. А. Основы аналитической теории чисел. М.: Наука, 1983 г.
5 Atkins D., Graff M., Lenstra A. K. and Leyland P. C. The magic words are squeamish ossifrage // ASIACRYPT-94, Lect. Notes in Comput. Sci. V. 917. Springer, 1995.
6 Кнут Д. Искусство программирования на ЭВМ. Т.2: Получисленные алгоритмы. М.: Мир, 1977.
7 Ахо А., Хопкрофт Дж., Ульман Дж. Построение и анализ вычислительных алгоритмов. М.: Мир, 1979.
9 Василенко О. Н. Современные способы проверки простоты чисел // Кибернетический сборник, вып. 25, 1988. С. 162-188.
10 Alford W. R., Granville A., Pomerance C. There are infinitely many Carmichael numbers // Ann. Math. 140, 1994. P. 703-722.
11 Прахар К. Распределение простых чисел. М.: Мир, 1967.
12 Plaisted D. A. Fast verification, testing, and generation of large primes // Theor. Comp. Sci. 9, 1979. P. 1-16.
13 Adleman L. M., Pomerance C., Rumely R. S. On distinguishing prime numbers from composite numbers // Annals of Math. 117, 1983. P. 173-206.
14 Lenstra H. W. (jr.) Primality testing algorithms (after Adleman, Rumely and Williams) // Lecture Notes in Math. V. 901, 1981. P. 243-257.
15 Cohen H., Lenstra H. W. (jr.) Primality testing and Jacobi sums // Math. of Comput. V. 42, #165, 1984. P. 297-330.
16 Riesel H. Prime numbers and computer methods for factorization.
17 Cohen H. A course in computational algebraic number theory. GraduateTexts in Math. V. 138. New York, Springer, 1993.
18 Coppersmith D., Odlyzko A. M., Schroeppel R. Discrete logarithms in // Algorithmica. V. 1, 1986. P. 1-15.
19 McCurley K. S. The discrete logarithm problem // Proc. of Symp. in Appl. Math. V. 42, 1990. P. 49-74.
20 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. P. 564-572.
22 Koblitz N. A Course in Number Theory and Cryptography. 2nd ed. Springer, 1994.
23 Lenstra A. K., Lenstra H. W. (jr.) The Development of the Number Field Sieve. Lect. Notes in Math. V. 1554. Springer, 1993.
24 Ben-Or M. Probabilistic algorithms in finite fields. Proc. 22 IEEE Symp. Found. Comp. Sci, 1981. P. 394-398.
25 Gordon D.M. Discrete logarithms in , using the number field sieve. SIAM J. Disc. Math. V.6, #1, 1993. P. 124-138.

References: V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V.