Bugtraq mailing list archives
Re: Breaking RSA: Totient indirect factorization
From: Watson Ladd <watsonbladd () gmail com>
Date: Wed, 14 Nov 2007 18:40:31 -0500
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
Current thread:
- Breaking RSA: Totient indirect factorization gandlf (Nov 14)
- Re: Breaking RSA: Totient indirect factorization Alexander Klimov (Nov 15)
- Re: Breaking RSA: Totient indirect factorization Clifton Royston (Nov 15)
- Re: Breaking RSA: Totient indirect factorization gandlf (Nov 15)
- Re: Breaking RSA: Totient indirect factorization Erick Galinkin (Nov 16)
- Re: Breaking RSA: Totient indirect factorization gandlf (Nov 15)
- Re: Breaking RSA: Totient indirect factorization Watson Ladd (Nov 16)