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: <4630EDBF.6000106@netrent.ch>
Date: Thu, 26 Apr 2007 20:21:51 +0200
From: Stephan Gammeter <st@...rent.ch>
To: full-disclosure@...ts.grok.org.uk
Subject: Re: Rapid integer factorization = end of RSA?

virus@...og.org schrieb:
> Hello,
>
> Brendan Dolan-Gavitt wrote:
>   
>> 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?
>>     
>
> no. We're talking about mathemetics, aren't we? So, an example for a 
> assumption is not a *proof*. Neither are two or three...
>
>   
>> Are you by any chance related to James Harris?
>>     
>
> Nope. Trying to prove Fermat's theorem is not from interest for me :)
>
> 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/
>
>   
Just factor a damn RSA-Challenge, then we'll believe you without seeing 
an actual proof. If not, you're just waisting our time with spamtastic 
entertainment.

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