Методы факторизации натуральных чисел. Ишмухаметов Ш.Т. - 193 стр.

Список литературы                                                            194

[22] Dixon J.D. Asymptotically fast factorization of integers / J.D. Dixon.–
    Math. Comp. 36, 1981, p. 255–260.

[23] Elkenbracht-Huising M. An implementation of the Number Field Sieve /
    M. Elkenbracht-Huising.– Experimental Mathematics, 1996, v.5, p. 231—-
    253.

[24] Gardner M. A new kind of cipher that would take millions years to break /
    M. Gardner.– Sci. Amer. 1977, p. 120–124.

[25] Gower J. Square form factorization/ J. Gower, S.S. Wagstaff Jr.– Mathe-
    matics of Computation, v.77 (2008), p. 551–588.

[26] Hackmann P. Elementary Number Theory / P. Hackmann.– HHH Publ,
    2007, 411 p.

[27] Joux A. A one round protocol for tripartie Diffie-Hellman. / A. Joux.– Al-
    gorithmic Number Theory: 4-th International Symposium, ANT–IV, Lecture
    Notes in Computer Science, v.1838(2000), Springer–Verlag, p. 385–393.

[28] Keller W. Prime factors k · 2n + 1 of Fermat numbers Fm and complete
    factoring status / W. Keller.– http://www.prothsearch.net/fermat.html

[29] Kleinjung T. On Polynomial Selection for the General Number Field Sieve/
    T. Kleinjung.– Math. Comp. 75 (2006), 2037–2047 p.

[30] Kleinjung T. Factorization of a 768-bit RSA modulus / T. Kleinjung et alt.–
    Scientific Report, 2010, 22 p.

[31] Lenstra H.W. Factoring integers with elliptic curves / H.W. Lenstra.–
    Ann.Math. v.126 (1987), p. 649–674.

[32] Lenstra A.K. Factoring integers with the number field sieve / A. K. Lenstra,
    H.W. Lenstra,Jr, M.S. Manasse, J.M. Pollard.– in [33] p. 11–42.

[33] Lenstra A. The Development of the Number Field Sieve / A. Lenstra and
    H. Lenstra (eds.).– Lect.Not.in Math.1554, Springer–Verlag, Berlin, 1993,
    139 p.