메뉴 건너뛰기




Volumn 48, Issue 177, 1987, Pages 329-339

The multiple polynomial quadratic sieve

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84968510096     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1987-0866119-8     Document Type: Article
Times cited : (81)

References (11)
  • 1
    • 0038076370 scopus 로고
    • Factorizations of b"1, b = 2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
    • Amer., Math. Soc., Providence, R. I
    • J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman S. S. Wagstaff, Factorizations of b" 1, b = 2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers, Contemp. Math., vol. 22, Amer. Math. Soc., Providence, R. I., 1983.
    • (1983) Contemp. Math , vol.22
    • Brillhart, J.1    Lehmer, D.H.2    Selfridge, J.L.3    Tuckerman, B.4    Wagstaff, S.S.5
  • 2
    • 0041038175 scopus 로고
    • Factorization Using the Quadratic Sieve
    • J. Davis D. Holdridge, Factorization Using the Quadratic Sieve, Sandia Report 83-1346, 1983.
    • (1983) Sandia Report , pp. 83-1346
    • Davis, J.1    Holdridge, D.2
  • 3
    • 84939376132 scopus 로고
    • Status report on factoring
    • (T. Beth, N. Cot, and I. Ingemarrson, eds.), Lecture Notes in Comput. Sei, Springer-Verlag, Berlin and New York
    • J. Davis D. Holdridge, "Status report on factoring," Advances in Cryptology (T. Beth, N. Cot, and I. Ingemarrson, eds.), Lecture Notes in Comput. Sei., vol. 209, Springer-Verlag, Berlin and New York, 1985, p. 183-215.
    • (1985) Advances in Cryptology , vol.209 , pp. 183-215
    • Davis, J.1    Holdridge, D.2
  • 4
    • 84966224573 scopus 로고
    • Factoring large numbers with a quadratic sieve
    • J. Gerver, "Factoring large numbers with a quadratic sieve," Math. Comp., v. 41, 1983, p. 287-294.
    • (1983) Math. Comp , vol.41 , pp. 287-294
    • Gerver, J.1
  • 5
    • 0003657590 scopus 로고
    • Semi-Numerical Algorithms, Addison-Wesley, Reading, Mass
    • D. Knuth, The Art of Computer Programming, Vol. 2, Semi-Numerical Algorithms, Addison-Wesley, Reading, Mass., 1969.
    • (1969) The Art of Computer Programming , vol.2
    • Knuth, D.1
  • 7
    • 84966219731 scopus 로고
    • A method of factoring and the factorization of FT
    • M. Morrison J. Brillhart, "A method of factoring and the factorization of FT," Math. Comp., v. 29, 1975, p. 183-205.
    • (1975) Math. Comp , vol.29 , pp. 183-205
    • Morrison, M.1    Brillhart, J.2
  • 9
    • 85027100501 scopus 로고
    • The quadratic sieve factoring algorithm
    • (T. Beth, N. Cot, and I. Ingemarrson, eds.), Lecture Notes in Comput. Sei, Springer-Verlag, Berlin and New York
    • C. Pomerance, "The quadratic sieve factoring algorithm," Advances in Cryptology (T. Beth, N. Cot, and I. Ingemarrson, eds.), Lecture Notes in Comput. Sei., vol. 209, Springer-Verlag, Berlin and New York, 1985, p. 169-182.
    • (1985) Advances in Cryptology , vol.209 , pp. 169-182
    • Pomerance, C.1
  • 10
    • 0005599967 scopus 로고
    • Analysis and comparison of some integer factoring algorithms
    • (H. Lenstra and R. Tijdeman, eds.)
    • C. Pomerance, "Analysis and comparison of some integer factoring algorithms," in Computational Methods in Number Theory (H. Lenstra and R. Tijdeman, eds.), 1982, p. 89-141.
    • (1982) Computational , pp. 89-141
    • Pomerance, C.1
  • 11
    • 33745008699 scopus 로고
    • Implementation of the continued fraction integer algorithm
    • C. Pomerance S. S. Wagstaff, "Implementation of the continued fraction integer algorithm," Congress. Numer., v. 37, 1983, p. 99-118.
    • (1983) Congress. Numer , vol.37 , pp. 99-118
    • Pomerance, C.1    Wagstaff, S.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.