Re: Cryptography and P=NP

Article View: sci.crypt

Article #1819

#1819

From: Jan Mattsson
Date: Tue, 17 Nov 1992 09:00

10 lines
1122 bytes

pdc@dcs.ed.ac.uk (Paul Crowley) writes:

>If such an algorithm was found, I wouldn't trust RSA further than I
>could throw it without a proof that factoring is something on this
>order of hardness, and such a proof doesn't exist at the moment.

Can you prove that breaking RSA requires factoring?
--
Jan Mattsson, CS student, Uppsala University, Sweden
janm@bern.docs.uu.se or janm@minsk.docs.uu.se

Technical Details

Message-ID: <janm.721990817@Minsk>

Path:

arc1-ca.pugleaf.net!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

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>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!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
From: janm@Minsk.docs.uu.se (Jan Mattsson)
Newsgroups: sci.crypt,sci.math,comp.theory
Subject: Re: Cryptography and P=NP
Date: 17 Nov 92 09:00:17 GMT
Organization: Uppsala University
Lines: 10
Distribution: inet
Message-ID: <janm.721990817@Minsk>
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>
Reply-To: janm@bern.docs.uu.se
NNTP-Posting-Host: minsk.docs.uu.se
Organisation: CS Dept., Uppsala University, Sweden

Reply to Parent Message