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, [EMAIL PROTECTED] <[EMAIL PROTECTED]> 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/
