Posts by Kevin

 1) (Message 485) Posted 8 Jun 2010 by Kevin Post: "The next (hopefully small) roadblock is EM47, a 256-digit number (thus out of GNFS range) with no prime factor smaller than 20 digits." Hopefully it isn't a p128 * p128 or similar, or else that would take you a few years. On the flip side, it would give a new world record if it were indeed a p128 * p128. 2) (Message 484) Posted 7 Jun 2010 by Kevin Post: "Even having equal size factors that are too close together can make the number easy to factor by the Fermat method." True.. But that's only if it's within sqrt(n)- (n^(1/4)) Also, there are non-math means to break an RSA key. (Ex: Timing attacks) 3) (Message 483) Posted 7 Jun 2010 by Kevin Post: I took the time to research.. It turns out I was incorrect on all counts. A sad day for me. The BOINC program slowed my computer to a crawl, to be honest.. 4) (Message 481) Posted 7 Jun 2010 by Kevin Post: 5) (Message 478) Posted 6 Jun 2010 by Kevin Post: 6) (Message 471) Posted 24 May 2010 by Kevin Post: 1. Random generation using random primes (Factors = p96 * p145) 2. Wait, wait, wait.. you only factor numbers of the form b^n + 1? By that reasoning, ask that question to everyone participating. Sorry for trying to contribute to the site.. Sheesh. O_O 7) (Message 469) Posted 24 May 2010 by Kevin Post: 682934139764871621059294670540409779256277785405904002174839913653988630704152088904136121991617552380023455259399723952023653153643548060833653509153580215597699356690840851264278901841510478481653190812472058220200188105772756389172416253

Home | My Account | Message Boards