Is Integer Factorization NP-Complete?

Is Integer Factorization in P?

Will the first quantum computer to factor two 2048-bit RSA moduli do so in under a minute?

Will a quantum computer factor the RSA-2048 challenge number before 2100?

Will a quantum computer factor the RSA-2048 challenge number before 2040?

Is Integer Factorization NP-Complete?

Will a polynomial time factoring algorithm be found by 2035?

Will someone find an efficient algorithm for calculating DIscrete Logarithms on a classical computer?

Can NP-complete problems be solved in polynomial time?

Will a quantum computer factor the RSA-2048 challenge number before 2050?