bugtraq - Re: Breaking RSA: Totient indirect factorization

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date: Wed, 14 Nov 2007 18:40:31 -0500
From: Watson Ladd <watsonbladd@...il.com>
To: bugtraq@...urityfocus.com
Subject: Re: Breaking RSA: Totient indirect factorization

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),
> 
> 


Download attachment "signature.asc" of type "application/pgp-signature" (250 bytes)