Article View: sci.crypt
Article #2636Finding BIG prime factors...
From: Mr. X
Date: Sat, 02 Jan 1993 00:45
Date: Sat, 02 Jan 1993 00:45
19 lines
1298 bytes
1298 bytes
I just remembered something which I read in (I think) "Computer" from about 6 or 7 years ago, only I can't remember the details and the question has been annoying me for years, whenever I think about it. There was an article about finding the prime factors of fairly large numbers (I believe on the order of 600 digits) of the form N=pq where p and q are primes. The article went on to say that somewhere some folks had a machine and software that could get said prime factors in precisely *3* machine cycles. What I cannot remember was what this systems type was. I seem to remember it being something called a "systolic" system, but I am not sure. I have forgotten the basic ideas behind these, so now I am doubly confused. Any of you folks know anything about such systolic systems (if indeed these are the one's I am thinking of) and how they go about sifting large primes in so short a time? Thanks, -Andy V.
Technical Details
Message-ID:
<1993Jan2.004516.19359@cbfsb.cb.att.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!stanford.edu!rutgers!att-out!cbfsb!cbnewsb.cb.att.com!osanShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!stanford.edu!rutgers!att-out!cbfsb!cbnewsb.cb.att.com!osan From: osan@cbnewsb.cb.att.com (Mr. X) Newsgroups: sci.crypt Subject: Finding BIG prime factors... Message-ID: <1993Jan2.004516.19359@cbfsb.cb.att.com> Date: 2 Jan 93 00:45:16 GMT Sender: news@cbfsb.cb.att.com Organization: Twilight Zone Lines: 19