Article View: sci.crypt
Article #3341Re: Security of RSA and factoring (correction).
From: stewart
Date: Mon, 19 Jan 1987 19:24
Date: Mon, 19 Jan 1987 19:24
10 lines
922 bytes
922 bytes
> It's not this easy. You need the factors of your prime to generate the
^^^^^^^^^^^^^^^^^^^^^
> RSA keys. This prevents you from setting up the "fake" RSA scheme to
> get the factorization.
I meant, of course, "the prime factors of your composite". Thanks to
those who (politely) pointed out my typo.
Bob Stewart
ihnp4!ihlpf!stewart
Technical Details
Message-ID:
<950@ihlpf.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!ihnp4!ihlpf!stewartReferences:
<9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <937@ihlpf.UUCP>Show Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!ihnp4!ihlpf!stewart From: stewart@ihlpf.UUCP Newsgroups: sci.crypt Subject: Re: Security of RSA and factoring (correction). Message-ID: <950@ihlpf.UUCP> Date: Mon, 19-Jan-87 14:24:05 EST Article-I.D.: ihlpf.950 Posted: Mon Jan 19 14:24:05 1987 Date-Received: Tue, 20-Jan-87 06:47:54 EST References: <9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <937@ihlpf.UUCP> Organization: AT&T Bell Labs, Naperville, IL Lines: 10