Take the 2-minute tour ×  If one should attempt to factorize a
number like the RSA-2048, or in general any number with $n$
decimal digits, using the best algorithm available and a modern
desktop PC, what is the approximate length in time it would take
(as a function of $n$) ? I'd like a general formula (possible
parameterized with CPU speed and/or # of cpu's) so I can apply
it to other numbers and PCs.   share|improve this question Oh,
you're ignoring the time it takes to read and write data (which
is considerable if you've quite the pile of digits)? On
computers nowadays, those might take more time than the
arithmetic operations themselves... –  Ｊ. Ｍ. Jul 16 '11 at 15:58
You'll likely be shuttling data in between operations... unless
you've big enough RAM, that is. Besides, the architecture of
your box is another possible influence... –  Ｊ. Ｍ. Jul 16 '11 at
16:07 Talking about running time estimation (apart any
input/output, memory usage consideration). –  TaoLee Jul 16 '11
at 16:28 J.M., what are you talkin