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] [day] [month] [year] [list]

Message-ID: <4638303B.1090808@nolog.org>
Date: Wed, 02 May 2007 08:31:23 +0200
From: virus@...og.org
To: full-disclosure@...ts.grok.org.uk
Subject: Re: Rapid integer factorization = end of RSA?

Hello,

Peter Kosinar wrote:
> Providing the factorization of a particular number (whose factorization is 
> considered to be not known by anyone) is definitely a proof that you know 
> the factorization of that number and that you had a method for finding it. 

of course agreed.

> Of course, it doesn't say anything about this method -- whether it is a 
> general one or whether you were able to find the factors based on graph of 
> temperature at the top of Elbrus :-)

Right, giving an example doesn't proof the method. That's what I was 
talking about. But it seems some participants of the list don't 
understand how to proof something in mathematics and take an example as 
a proof for a method.

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/