home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #27 / NN_1992_27.iso / spool / sci / crypt / 4920 < prev    next >
Encoding:
Internet Message Format  |  1992-11-17  |  1.1 KB
  1. Xref: sparky sci.crypt:4920 sci.math:15108 comp.theory:2447
  2. Path: sparky!uunet!usc!sol.ctr.columbia.edu!ira.uka.de!math.fu-berlin.de!unidui!rrz.uni-koeln.de!Germany.EU.net!mcsun!sunic!corax.udac.uu.se!Minsk.docs.uu.se!janm
  3. From: janm@Minsk.docs.uu.se (Jan Mattsson)
  4. Newsgroups: sci.crypt,sci.math,comp.theory
  5. Subject: Re: Cryptography and P=NP
  6. Date: 17 Nov 92 09:00:17 GMT
  7. Organization: Uppsala University
  8. Lines: 10
  9. Distribution: inet
  10. Message-ID: <janm.721990817@Minsk>
  11. References: <1992Nov15.110945.19939@ringer.cs.utsa.edu> <PHR.92Nov15203840@napa.telebit.com> <1992Nov16.152501.22172@CSD-NewsHost.Stanford.EDU> <Bxtowv.246@dcs.ed.ac.uk>
  12. Reply-To: janm@bern.docs.uu.se
  13. NNTP-Posting-Host: minsk.docs.uu.se
  14. Organisation: CS Dept., Uppsala University, Sweden
  15.  
  16. pdc@dcs.ed.ac.uk (Paul Crowley) writes:
  17.  
  18. >If such an algorithm was found, I wouldn't trust RSA further than I
  19. >could throw it without a proof that factoring is something on this
  20. >order of hardness, and such a proof doesn't exist at the moment.
  21.  
  22. Can you prove that breaking RSA requires factoring?
  23. --
  24. Jan Mattsson, CS student, Uppsala University, Sweden
  25. janm@bern.docs.uu.se or janm@minsk.docs.uu.se
  26.