페르마 인수분해 방법의 확장과 검증에 대한 고찰
A Consideration on Verification and Extension of Fermat's Factorization
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
There are some efficient brute force algorithm for factorization. Fermat's factorization is one of the way of brute force attack. Fermat's method works best when there is factor near the square-root. This paper shows that why Fermat's method is effective and verify that there are only one answer. Because there are only one answer, we can start Fermat's factorization anywhere. Also, we convert from factorization to finding square number.
Abstract
There are some efficient brute force algorithm for factorization. Fermat's factorization is one of the way of brute force attack. Fermat's method works best when there is factor near the square-root. This paper shows that why Fermat's method is effective and verify that there are only one answer. Because there are only one answer, we can start Fermat's factorization anywhere. Also, we convert from factorization to finding square number.
참고문헌 (9)
- G.Wilson, "Factorization of the covariance generating function of a pure moving average process", SIAM J.Numer.Anal., pp.1~7 (1969)
- R.Solovay, "A fast Monte-Carlo test for primality", SIAM Journal on Computing, 6(1), pp.84~85 (1977)
- O.Rabin, "Probabilistic algorithm for testing primality", Journal of Number Theory, 12(1), pp.128~138 (1980)
- C.Mcintosh, "Finding prime numbers:Miller rabin and beyond", Furman University Electronic, 12, pp.1~4 (2007)
- E.Bach, "Toward a theory of Pollard's rho method", Information and Computation, 90(2), pp.139~155 (1991)
- 김종국, "Fermat의 定理에 關한 硏究", 박사, pp.1989
- 이민섭, "현대암호학, 2판", pp.272~292 (2007), 敎友社
- J.McKee, "Speeding Fermat's factoring method", Mathematics of Computation, pp.1729~1737 (1999)
- D.M. Burton, "Elementary number theory", pp.82~88 (1998), McGRAW HILL