Can Integer Factorization be in P?
Can the integer factorization problem be solved in polynomial time? or is the RSA public-key cryptosystem breakable in polynomial time? Answers to these questions are not only important in mathematics but also important in network and information security. In this paper, a motivation for solving IFP from RSA will be introduced, and then some methods for IFP will be discussed. Finally, some ideas, comments and advice on the practical use of RSA will be presented.