🚀 go-pugleaf

In article <avalon.712399566@coombs> avalon@coombs.anu.edu.au (Darren Reed) writes:

   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 :).


D.E. Knuth, _The Art of Computer Programming, Vol.2 Seminumerical
Algorithms_, 1980.

Hans Riesel, _Prime Numbers and Computer Methods of Factorization_,
1985.  (Or something like that -- my copy is at home so I may have got
the title slightly wrong.)

Both of these have good introductions to RSA and RSA-like encryption
methods.  Both should be available in a good university library; Knuth
at least is still in print and I'd argue strongly that every
programmer should own a copy of all three of his volumes.


Paul
--
Paul Leyland <pcl@oxford.ac.uk>          | Hanging on in quiet desperation is
Oxford University Computing Service      |     the English way.
13 Banbury Road, Oxford, OX2 6NN, UK     | The time is come, the song is over.
Tel: +44-865-273200  Fax: +44-865-273275 | Thought I'd something more to say.