This paper presents two new factoring methods which apply to numbers with certain properties. When one factor of an integer has a long all-zero or all-one string in its binary representation, factorization of the integer can be made more efficient using one of the complementary algorithms proposed in this paper. Based on the proposed algorithms, new criterion for secure RSA moduli should be taken into account.