Pick a set of primes. If unable to factor a number N, then use the Chinese Remainder Theorem to compute another number X which has the same remainders when divided by each of the primes in the set. See if you can factor X. If not, try another X. Is the factorization (or recursive factorization) of an X at all useful for factoring N?
No comments :
Post a Comment