Basic HTML version of Foils prepared May 12 1996

Foil 14 SECOND Backend Processing STAGE GRAPH REDUCTION

From Lessons and Implementation -- RSA Factoring on the Web CRPC Annual Meeting -- May 14-17 1996. by Geoffrey Fox
1 Take the processed partials/double-partials and the true "fulls" and now we want to find a new "a" which on combining current a's is a proper square number!
2 Perform a Gaussian elimination looking for a linear dependency module two of a bitmatrix of F columns and R rows, where F is the size of the small-primes factor base and R is the number of quadratic residues.
3 This is a big but not tera-op (for RSA155) computation. But at the end, if a dependency falls out, we know the factors of RSA-N.
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