Article View: sci.crypt
Article #4244Re: High Performance Mathematical Sieve
From: Brian C. Anderson
Date: Thu, 10 Nov 1988 07:00
Date: Thu, 10 Nov 1988 07:00
19 lines
1253 bytes
1253 bytes
In article <179@cs-spool.calgary.UUCP> hermann@cpsc.ucalgary.ca (Michael Hermann) writes: > > High Performance Mathematical Sieve . . . > We're trying to have the cost of the fully configured >system be something less than $5000 (Cdn.) in cost, and have >it available by early 1990... . . . > If you know of anyone else who may be interested, but >was not able to read this net posting, we'd appreciate you >passing this information along to them as well. There is one very well financed organization that might be extremely interested in hardware solution of the type you propose, known in the US as the NSA. They are, however, quite paranoid about security matters. :-)
Technical Details
Message-ID:
<3279@mit-amt>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!attcan!uunet!ncrlnk!ncrcae!hubcap!gatech!rutgers!mit-eddie!mit-amt!castilloReferences:
<179@cs-spool.calgary.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!attcan!uunet!ncrlnk!ncrcae!hubcap!gatech!rutgers!mit-eddie!mit-amt!castillo From: castillo@mit-amt (Brian C. Anderson) Newsgroups: sci.crypt,sci.math,comp.arch Subject: Re: High Performance Mathematical Sieve Keywords: Diophantine equations, factoring, primes, special purpose hardware. Message-ID: <3279@mit-amt> Date: 10 Nov 88 07:00:21 GMT References: <179@cs-spool.calgary.UUCP> Reply-To: castillo@media-lab.media.mit.edu (Brian C. Anderson) Organization: MIT Media Lab, Cambridge MA Lines: 19