|
RSA155 requires about 300 teraops hours to solve with NFS
|
|
RSA129 needed about an order of magnitude less time. Can be done today faster if use Number Field Sieve
|
|
We have roughly one to five million independent calculations which form the rows of matrix (after clever graph theory manipulates and combines)
|
Set of master servers publish problem to solved with suitable demos, description of algorithm and full marketing attention.
-
Clients download software, run tests and certify with test case.
-
Clients pick the set of a's they hope to do in a week
-
PC's pick the smaller numbers needing less memory and CPU power
-
Cray's pick the largest hardest numbers
|
|
Clients return results -- not so easy except by email and cut and paste
|
|
Best done as a set of cooperating servers where server performing factorization publishs it solution as a file on the WWW.
|
|
Cooperating servers also better for computer administrators as can control set of clients at a given site
|
|
Initially use humans but replace by agents when software ready
|
