 The numbers "p" and "q" should not be "too close", lest the Fermat factorization for "n" be successful.If "p" − "q" is less than 2"n"1/4 ("n" = "p" * "q", which for even small 1024-bit values of "n" is ) solving for "p" and "q" is trivial.Furthermore, if either "p" − 1 or "q" − 1 has only small prime factors, "n" can be factored quickly by Pollard's p − 1 algorithm, and such values of "p" or "q" should hence be discarded.