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 14:07:31 +0400 |
Funny way to pull the -1 out from the parenthesis. p * (-q) = p * (-1) * q = p * q * (-1) (mod pq) That is, p * (-q) = 0 (mod pq).
Well, let's proof: some days ago RSA-640 was factored, therefore I'll use this number for proofing. N = p*q = 3107418240490043721350750035888567930037346022842727545720161948823206440518081504556346829671723286782437916272838033415471073108501919548529007337724822783525742386454014691736602477652346609 p = 1634733645809253848443133883865090859841783670033092312181110852389333100104508151212118167511579 q = 1900871281664822113126851573935413975471896789968515493666638539088027103802104498957191261465571 Hence p*(-q) = p*(N-q), we have: 1634733645809253848443133883865090859841783670033092312181110852389333100104508151212118167511579*(3107418240490043721350750035888567930037346022842727545720161948823206440518081504556346829671723286782437916272838033415471073108501919548529007337724822783525742386454014691736602477652346609-1900871281664822113126851573935413975471896789968515493666638539088027103802104498957191261465571) = 5079801149330465928652035530544913704964519649664113022948507643221268839586387905945718488562426349551024378408981587404238854112680081565808050803367178098655476230508056302202082021498932996241380749611265431048278537997959344921052965979997472486960464297533557254211807262177876539002; and, by my gypothesis: p*(-q) = p*q *(p-1) = p*(N-q) 163473364580925384844313388386509085984178363092312181110852389333100104508151212118167511579*1900871281664822113126851573935413975471896789968515493666638539088027103802104498957191261465571*1634733645809253848443133883865090859841783670033092312181110852389333100104508151212118167511578 = 5079801149330465928652035530544913704964519649664113022948507643221268839586387905945718488562426349551024378408981587404238854112680081565808050803367178098655476230508056302202082021498932996241380749611265431048278537997959344921052965979997472486960464297533557254211807262177876539002; Q.E.D Any new idea? _______________________________________________ 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] Rapid integer factorization = end of RSA?, Stanislaw Klekot |
|---|---|
| Next by Date: | Re: [Full-disclosure] Rapid integer factorization = end of RSA?, Stanislaw Klekot |
| Previous by Thread: | Re: [Full-disclosure] Rapid integer factorization = end of RSA?, Pavel Kankovsky |
| Next by Thread: | Re: [Full-disclosure] Rapid integer factorization = end of RSA?, Stanislaw Klekot |
| Indexes: | [Date] [Thread] [Top] [All Lists] |