We investigate the performance of a streamlined version of Shor's algorithm in which the quantum Fourier transform is replaced by a banded version that, for each qubit, retains only coupling to its nearest neighbors. Defining the performance of the -qubit algorithm for bandwidth as the ratio of the success rates of Shor's algorithm equipped with the banded and the full-bandwidth () versions of the quantum Fourier transform, our numerical simulations show that for (nonexponential regime) and for (exponential regime), where , the location of the transition, is approximately given by for , , and . Analytically we obtain for and for , where . Thus, our analytical results predict the scaling () and the scaling () of the data perfectly. In addition, in the large- regime, the prefactor in is close to the results of our numerical simulations, and in the low- regime, the numerical scaling factor in our analytical result is within a factor 2 of its numerical value. As an example we show that is sufficient for factoring RSA-2048 with a 95 success rate.