From: steveisi@vt.edu (steveisi) Newsgroups: sci.math Subject: Re: facotoring algorithm PPMPQS Date: 23 Apr 1995 03:14:11 GMT In article <3n967o$sn5@news.acns.nwu.edu>, glendy@merle.acns.nwu.edu (Yukki Kam) says: > >Hi: > >I have learned that a facotoring algorithm PPMPQS was >used to factor very large numbers into their prime >factors, and was used recently to break a 130-digit RSA >modulo. > >Does anyone have any information about this algorithm? >I am paricularly interested in the speed and complexity >of the algorithm. Actually it was a 129-digit RSA modulus, but who's counting? In answer to your question, the abstract written about that factorization does contain some information on the PPMPQS. You can get it at: flash.bellcore.com:/pub/lenstra/rsa129.ps. You can probably get it elsewhere also, but that's where I got it. It's about fifteen pages and in postscript so it'll be about 200K. Steven Sinnott steveisi@vt.edu