> Quantum computer, however, is good at integer factorization. Using Shor’s algorithm, quantum computer does integer factorization in polynomial time, which makes cracking the RSA cryptosystem possible.

Does increasing the size of the key get around this problem, if not is there any solution to this?