Basic HTML version of Foils prepared May 12 1996

Foil 8 General Number Field Sieve -- GNFS:

From Lessons and Implementation -- RSA Factoring on the Web CRPC Annual Meeting -- May 14-17 1996. by Geoffrey Fox


1 The latest (mathematical) factoring technology
2 Sieving over sets of "Q-values" (i.e., very large ranges of integers)
3 Task specifications are small (the integer bounds of the Q-range)
4 Task results are large (collections of "partial relations")
5 These results must be accumulated, sorted, and run through a neat graph algorithm before they are fed into the final bitmatrix reduction step (done on Maspar in previous factoring efforts but any reasonable machine will handle)
6 Forms an ideal, embarrassingly parallel application for Web-wide coordination: very large, naturally distributed database computation which can be done with PC's up.
7 Note we build on and still support factoring by email preferred by users in secure/uncommunicative environments!

in Table To:


© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Dec 14 1997