Ethical Hacking Learn to find vulnerabilities before the bad guys do! Gain real world hands on hacking experience in our state of the art hacking lab. Course designed and taught by expert instructors with years of penetration testing experience. 12 student maximum in every class. Certification attempt included in every package. | Computer Forensics Training at InfoSec Institute Gain the in-demand skills of a certified computer examiner, learn to recover trace data left behind by fraud, theft, and cybercrime perpetrators. Discover the source of computer crime and abuse at your organization so that it never happens again. All of our class sizes are guaranteed to be 12 students or less to facilitate one-on-one interaction with one of our expert instructors. |

| Subject: | Re: [Full-disclosure] Rapid integer factorization = end of RSA? |
|---|---|
| Date: | Thu, 26 Apr 2007 19:43:03 +0200 |
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/
| Previous by Date: | Re: [Full-disclosure] WordPress v2.1.3 >> remote file include~, Tod Beardsley |
|---|---|
| Next by Date: | Re: [Full-disclosure] Rapid integer factorization = end of RSA?, Kurt Buff |
| Previous by Thread: | Re: [Full-disclosure] Rapid integer factorization = end of RSA?, Brendan Dolan-Gavitt |
| Next by Thread: | Re: [Full-disclosure] Rapid integer factorization = end of RSA?, Stephan Gammeter |
| Indexes: | [Date] [Thread] [Top] [All Lists] |