Article View: sci.crypt
Article #531Re: RSA Public Key Generations.
From: Paul Rubin
Date: Wed, 29 Jul 1992 09:39
Date: Wed, 29 Jul 1992 09:39
15 lines
1016 bytes
1016 bytes
Hi, I've been looking at implementing RSA encrpytion and have found that
generating the initial keys is a somewhat tricky. The only algorithm
I have found for generation the public key is:
N = x*y
p*s mod (x-1)(y-1) = 1
and solve for p. :(
Is there an easy way to solve this problem ?
It's straightforward to do this with Euclid's algorithm.
See for example Knuth vol. 2. (Look in the index under Euclid).
Most other algorithm books or number theory books should explain
this algorithm also.
Technical Details
Message-ID:
<PHR.92Jul29093938@soda.berkeley.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!agate!agate!phrReferences:
<avalon.712399566@coombs>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!agate!agate!phr From: phr@soda.berkeley.edu (Paul Rubin) Newsgroups: sci.crypt Subject: Re: RSA Public Key Generations. Date: 29 Jul 92 09:39:38 Organization: CSUA/UCB Lines: 15 Message-ID: <PHR.92Jul29093938@soda.berkeley.edu> References: <avalon.712399566@coombs> NNTP-Posting-Host: soda.berkeley.edu In-reply-to: avalon@coombs.anu.edu.au's message of 29 Jul 92 08:46:06 GMT