Is the integer-factorization problem (used for many cryptographic applications) NP-Complete?

As the question s开发者_如何学Pythontates, does the integer-factorization problem fall into the class of NP-Complete problems?

Factoring:

• It is not known to be NP-complete. (No reduction from an NP-complete problem has been found.)
• It is not known not to be NP-complete either (if we knew the latter about some nontrivial problem in NP, it would mean P≠NP, so the latter is not surprising).
• No polynomial factoring algorithm is known (or believed to exist), so it is believed not to be in P either.

The informal consensus/belief is that this is one of the "in-between" problems that are not in P and are not NP-complete. Of course, this belief is less strong and widely held than P≠NP.

Yes ,because you can make reduction to the factorization problem for any integer number to decision problem by using a function when the answer is (No) that means this number is a composite then you can track their prime factors .