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

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

[34] Menezes A.    Reducing Elliptic Curve Logarithms to a Finite Field /
    A. Menezes, T. Okamoto, S. Vanstone.– IEEE Trans. Info. Theory, v.39,
    1993, p. 1639–1646.

[35] Menezes A. Elliptic Curve Public Key Cryptosystems / A. Menezes.– 1993,
    144 p.

[36] Montgomery P.L. Speeding the Pollard and Elliptic Curve Methods of Fac-
    torization./P.L. Montgomery.– Mathematics of Computation, v.48, iss.177,
    1987, p.234–264.

[37] Montgomery P.L. An FFT-extension of the Elliptic Curve Method of Facti-
    rization / P.L. Montgomery.– Doctoral Dissertation, 1992, Univ.Calif. USA,
    118 p.

[38] Montgomery P.L. A block Lanczos algorithm for finding dependences over
    GF(2)/ P.L. Montgomery.– in Advances in Cryptology: Eurocrypt’95,
    Lect.Notes in Comp.Sci. 921, Springer–Verlag, Berlin, p. 106–120.

[39] Montgomery     P.L.   Square    roots   of   products   of   algebraic   num-
    bers./P.L. Montgomery.– 1997, 24 p. http://ftp.cwi.nl/pub/pmontgom/
    sqrt.ps.gz.

[40] Morrison M.A. A Method of Factoring and the Factorization of F7 /
    M.A. Morrison, J. Brillhart.– Mathematics of Computation, AMS, 29
    (129),January 1975, p.183–205.

[41] Murphy D.A. Polynomial selection for the number field sieve./ B.A. Murphy.
    – Doctoral Thesis, Australia, 1999, 142 p.

[42] Niven I. An introduction to the number theory/ I. Niven, H. Zuckrman,
    H. Mongomery. – Willey Publ., 5-th edition, 1991, 541 p.

[43] Pollard J.M. Theorems on factorization and primality testing / J.M. Pollard.
    – Proc.Cambridge Phil.Society. 1974, v.76, p. 521-578.