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

Question

As the question says, the problem of integer decomposition falls into the class of NP-complete problems?

Answer 1

Factoring:

• It is not NP-complete. (No problems were found with the NP-complete problem.)
• It is not known that it is not NP-complete (if we knew the latter about some non-trivial problem in NP, this would mean P ≠ NP, so the latter is not surprising).
• There is no polynomial factoring algorithm (or it is believed that it exists), so it is believed that it is also not in P.

An unofficial consensus / belief is that this is one of the “intermediate” issues that are not in P and are not NP-complete. Of course, this belief is less powerful and widespread than P ≠ NP.

Answer 2

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