Basic HTML version of Foils prepared May 12 1996
| 1 | For places that satisfy threshold constraint, the client workers emit the prime factorizations for the "a"s and print out the matching "b"s. |
| 2 | If there's a set of "a"'s whose product's factorization consists of primes raised to EVEN powers, then the product is a square, and so is the product of all the matching b^2 terms (trivially). |
| 3 | This would give the happy result that |
| 4 | x^2==y^2 (modulo RSA-N), and we'd have our factorization! |