Proving that integer factorization could not be done in polynomial time would incidentally prove that P != NP.
Proving that integer factorization could not be done in polynomial time would incidentally prove that P != NP.