This is an exponential space algorithm and therefore utterly and completely useless with regards to factoring. > > Algorithm > --------- > > - Repeat "a = a^n mod m" with n from 2 to m, saving all the results in > a table until a == 1 (Statement 4). > - Examine the table from end to begining printing "n" if the number of > "ones" is divided by "n" (Statements 1,2,3), > >
Attachment:
signature.asc
Description: OpenPGP digital signature