Dixon's Factorization method is an integer factorization algorithm. It is the prototypical factor method. The only factor base method for which a run-time bound not dependent on conjectures about the smoothness properties of values of a polynomial is known. Dixon's technology depends on discovering a congruence of squares modulo the integer. Using Fermat's factorization algorithm we can find a congruence by selecting a pseudo-random x values and hoping that x^2modN is a perfect square.
Enter the no.: