home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / alt / hackers / 1343 < prev    next >
Encoding:
Internet Message Format  |  1992-09-01  |  668 b 
  1. Path: sparky!uunet!haven.umd.edu!darwin.sura.net!zaphod.mps.ohio-state.edu!rpi!utcsri!devnull
  2. Newsgroups: alt.hackers
  3. From: flaps@dgp.toronto.edu (Alan J Rosenthal)
  4. Subject: Re: Prime Number Generator
  5. Message-ID: <1992Sep1.132304.20355@jarvis.csri.toronto.edu>
  6. References: <grtyj5-@rpi.edu> <1992Aug31.160225.26724@gateway.novell.com> <3756@randvax.rand.org>
  7. Date: 1 Sep 92 17:23:04 GMT
  8. Approved: snot@rags.com
  9. Lines: 7
  10.  
  11. jim@rand.org (Jim Gillogly) writes:
  12. >The whole idea beind RSA encryption is that large prime numbers are *easy* to
  13. >prove prime,
  14.  
  15. Running a probabilistic algorithm does not yield a proof that they're prime.
  16.  
  17. (Or is there a non-probabilistic way?)
  18.