페르마 인수분해 방법의 확장과 검증에 대한 고찰

A Consideration on Verification and Extension of Fermat's Factorization

초록

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.

키워드

Fermat; factorization; square root
제목
페르마 인수분해 방법의 확장과 검증에 대한 고찰
제목 (타언어)
A Consideration on Verification and Extension of Fermat's Factorization
저자
정서현; 정수환
발행일
2010-06
저널명
정보보호학회논문지
권
20
호
3
페이지
3 ~ 8