full-disclosure - Re: Rapid integer factorization = end of RSA?

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]

Message-ID: <589e556c0704260826p69d0a880k66d8ef1e90a61266@mail.gmail.com>
Date: Thu, 26 Apr 2007 11:26:36 -0400
From: "Brendan Dolan-Gavitt" <mooyix@...il.com>
To: "virus@...og.org" <virus@...og.org>
Cc: full-disclosure@...ts.grok.org.uk
Subject: Re: Rapid integer factorization = end of RSA?

If you have, in fact, come up with a fast method of integer
factorization, the currently unfactored challenges (RSA-704 and above)
would be better proof, no?

Are you by any chance related to James Harris?
http://www.crank.net/harris.html

-Brendan

On 4/26/07, virus@...og.org <virus@...og.org> wrote:
> Hello,
>
> Eugene Chukhlomin wrote:
> > Well, let's proof: some days ago RSA-640 was factored, therefore I'll
> >  use this number for proofing.
> > N = p*q = 3107418240490043721... [...] Q.E.D
>
> that's an example. Not a *proof*.
>
> GTi
>
> _______________________________________________
> Full-Disclosure - We believe in it.
> Charter: http://lists.grok.org.uk/full-disclosure-charter.html
> Hosted and sponsored by Secunia - http://secunia.com/
>

_______________________________________________
Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/