1 최명복, "n + 1 소인수분해 알고리즘" 한국인터넷방송통신학회 11 (11): 106-112, 2011
2 최명복, "k-페르마 소인수분해 알고리즘" 한국인터넷방송통신학회 11 (11): 157-164, 2011
3 Wikipedia, "Trial Division"
4 D. John, "The Prime Number Theorem, In Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics" Joseph Henry Press 2003
5 A. K. Lenstra, "The Factorization of the Ninth Fermat Number" 61 : 319-349, 1993
6 J. McKee, "Speeding Fermat's Factoring Method" 68 : 1729-1737, 1999
7 R. P. Brent, "Recent Progress and Prospects for Integer Factorisation Algorithms" 3-22, 2000
8 Wikipedia, "RSA Factoring Challenge"
9 Wikipedia, "RSA"
10 C. Ric, "Prime Numbers: A Computational Perspective (2nd ed.)" Springer-Verlag 2005
1 최명복, "n + 1 소인수분해 알고리즘" 한국인터넷방송통신학회 11 (11): 106-112, 2011
2 최명복, "k-페르마 소인수분해 알고리즘" 한국인터넷방송통신학회 11 (11): 157-164, 2011
3 Wikipedia, "Trial Division"
4 D. John, "The Prime Number Theorem, In Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics" Joseph Henry Press 2003
5 A. K. Lenstra, "The Factorization of the Ninth Fermat Number" 61 : 319-349, 1993
6 J. McKee, "Speeding Fermat's Factoring Method" 68 : 1729-1737, 1999
7 R. P. Brent, "Recent Progress and Prospects for Integer Factorisation Algorithms" 3-22, 2000
8 Wikipedia, "RSA Factoring Challenge"
9 Wikipedia, "RSA"
10 C. Ric, "Prime Numbers: A Computational Perspective (2nd ed.)" Springer-Verlag 2005
11 K. Thorsten, "On Polynomial Selection for the General Number Field Sieve" 75 (75): 2037-2047, 2006
12 T. H. Cormen, "Introduction to Algorithms (2nd ed.)" MIT Press and McGraw-Hill 2001
13 J. D. Dixon, "Asymptotically fast factorization of integers" 36 : 255-260, 1981
14 C. Pomerance, "Analysis and Comparison of Some Integer Factoring Algorithms, in Computational Methods in Number Theory" 154 : 89-139, 1982