Explain the step-by-step logic behind Shor's algorithm for integer factorization and its profound implications for modern public-key cryptography, specifically RSA. Discuss the Quantum Fourier Transform's role within the algorithm and estimate the number of logical qubits required to factor a 2048-bit integer, assuming current error rates and the necessity for quantum error correction codes.