I don't believe that for a second.
No one in their right mind would use a 128 bit RSA key.
That's like building a save out of paper towels, utterly ridiculous.
You wouldn't even need anything fancy like ec2.
Any dated PC can do it. My extra cheap android phone could probably do it.
Just cracked some of these to see how long it would take:
about 90ms
Code:
psyblade@exile:~/Downloads/msieve-1.51$ openssl genrsa -out private_key.pem 128
Generating RSA private key, 128 bit long modulus
.....+++++++++++++++++++++++++++
..+++++++++++++++++++++++++++
e is 65537 (0x10001)
psyblade@exile:~/Downloads/msieve-1.51$ openssl rsa -text -in private_key.pem
Private-Key: (128 bit)
modulus:
00:c8:e5:53:b1:a1:8e:92:54:c9:ae:3e:34:8d:0d:
2e:67
publicExponent: 65537 (0x10001)
privateExponent:
5f:bb:58:5c:a7:3e:07:60:62:df:97:f2:4a:5b:de:
21
prime1: 18045925538829197897 (0xfa7001aa89106249)
prime2: 14797596946545642287 (0xcd5ba00598420b2f)
exponent1: 5192364891369793929 (0x480efc5bbe4e6989)
exponent2: 1626365119031512907 (0x169202757af58f4b)
coefficient: 15246574586748322863 (0xd396b6ce8ca1c42f)
writing RSA key
-----BEGIN RSA PRIVATE KEY-----
MGICAQACEQDI5VOxoY6SVMmuPjSNDS5nAgMBAAECEF+7WFynPgdgYt+X8kpb3iEC
CQD6cAGqiRBiSQIJAM1boAWYQgsvAghIDvxbvk5piQIIFpICdXr1j0sCCQDTlrbO
jKHELw==
-----END RSA PRIVATE KEY-----
psyblade@exile:~/Downloads/msieve-1.51$ time ./msieve -vt4 0x00c8e553b1a18e9254c9ae3e348d0d2e67
Msieve v. 1.51 (SVN Unversioned directory)
Wed Jun 5 21:40:19 2013
random seeds: 98227976 5cf15695
factoring 267036332650968963298315293404894670439 (39 digits)
no P-1/P+1/ECM available, skipping
commencing quadratic sieve (39-digit input)
using multiplier of 31
using generic 64kb sieve core
sieve interval: 2 blocks of size 65536
processing polynomials in batches of 51
using a sieve bound of 7151 (450 primes)
using large prime bound of 286040 (18 bits)
polynomial 'A' values have 5 factors
restarting with 312 full and 2381 partial relations
699 relations (312 full + 387 combined from 2381 partial), need 546
sieving complete, commencing postprocessing
begin with 2693 relations
reduce to 1020 relations in 2 passes
attempting to read 1020 relations
recovered 1020 relations
recovered 128 polynomials
attempting to build 699 cycles
found 699 cycles in 1 passes
distribution of cycle lengths:
length 1 : 312
length 2 : 387
largest cycle: 2 relations
matrix is 450 x 699 (0.1 MB) with weight 13338 (19.08/col)
sparse part has weight 13338 (19.08/col)
filtering completed in 3 passes
matrix is 432 x 496 (0.0 MB) with weight 8381 (16.90/col)
sparse part has weight 8381 (16.90/col)
commencing Lanczos iteration
memory use: 0.1 MB
lanczos halted after 8 iterations (dim = 430)
recovered 64 nontrivial dependencies
prp20 factor: 14797596946545642287
prp20 factor: 18045925538829197897
elapsed time 00:00:00
real 0m0.087s
user 0m0.064s
sys 0m0.020s