home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!munnari.oz.au!manuel!coombs!avalon
- From: avalon@coombs.anu.edu.au (Darren Reed)
- Subject: RSA Public Key Generations.
- Message-ID: <avalon.712399566@coombs>
- Lines: 17
- Sender: news@newshost.anu.edu.au
- Organization: Computer Services Centre, Australian National University
- Date: 29 Jul 92 08:46:06 GMT
-
- 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 ?
-
- If anyone can give me some clues on how to do this, it would be great
- (or even where to look for some clues :).
-
- Thanks,
- Darren
-