home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #23 / NN_1992_23.iso / spool / sci / crypt / 3666 < prev    next >
Encoding:
Text File  |  1992-10-07  |  1.1 KB  |  30 lines
  1. Newsgroups: sci.crypt
  2. Path: sparky!uunet!sun-barr!cs.utexas.edu!wupost!darwin.sura.net!zaphod.mps.ohio-state.edu!sample.eng.ohio-state.edu!mckinley!butzerd
  3. From: butzerd@mckinley.eng.ohio-state.edu (Dane C. Butzer)
  4. Subject: Re: RSA claims 33 and 37 of U.S. patent 4,405,829
  5. Message-ID: <1992Oct7.145231.19795@ee.eng.ohio-state.edu>
  6. Sender: news@ee.eng.ohio-state.edu
  7. Organization: The Ohio State University Dept of Electrical Engineering
  8. Distribution: na
  9. Date: Wed, 7 Oct 1992 14:52:31 GMT
  10. Lines: 18
  11.  
  12. Just another (possibly naive) thought,
  13.  
  14. Isn't it true that any ploynonmial in a computer is by default:
  15.  
  16.         polynomial mod 2^n
  17.  
  18. n being the length in bits of the variable used to store the
  19. solution?  And weren't there at least a few encrpytion programs with
  20. polynomials in them before RSA?  Couldn't this be prior art, too?  Or
  21. does prior art have to be intentional (ie. yes, the equations were mod
  22. 2^n, but that wasn't on purpose...)?  Comments?
  23.  
  24.  
  25. Dane Butzer
  26. _______________________________________________________________________
  27. Standard disclaimer applies...
  28. -----------------------------------------------------------------------
  29.  
  30.