home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #20 / NN_1992_20.iso / spool / sci / crypt / 3122 < prev    next >
Encoding:
Internet Message Format  |  1992-09-08  |  1001 b 
  1. Path: sparky!uunet!ogicse!reed!nelson
  2. From: nelson@reed.edu (Nelson Minar)
  3. Newsgroups: sci.crypt
  4. Subject: Re: Probabilistic encryption
  5. Message-ID: <1992Sep6.210851.11931@reed.edu>
  6. Date: 6 Sep 92 21:08:51 GMT
  7. Article-I.D.: reed.1992Sep6.210851.11931
  8. References: <9209060713.AA27357@news.cis.ohio-state.edu>
  9. Organization: Reed College, Portland, OR
  10. Lines: 15
  11.  
  12. In article <9209060713.AA27357@news.cis.ohio-state.edu>
  13. Marc.Ringuette@daisy.learning.cs.cmu.edu writes:
  14. >[encryption algorithm that seems as useful and secure as RSA]
  15. >Still, the practicality of the algorithm and the excellent cryptographic
  16. >guarantees makes it a very attractive method.  Does anyone know if it's
  17. >gotten much attention?
  18.  
  19. Is it under the same restrictions RSA is? If the algorithm is freely
  20. usable, and it's provably as secure as RSA, I'm amazed that someone
  21. hasn't implemented and distributed it widely.
  22.  
  23. Is there a catch?
  24. -- 
  25.                 __
  26. nelson@reed.edu \/           Fortune presents gifts not according to the book
  27.