**ccc** (11/12/82)

There is a much faster method for finding the M. I. where p is prime. It involves using Euclid's alorithm and the so-called "magic box". I can dig up my old number theory notes and post the algorithm to the net if anyone's interested... I used the method in an implementation of a public-key cryptosystem a while back, and for large (>75 digit) primes it was about 50 times faster than an incremental search, and it gets better as the prime gets larger. Clayton Elwell {usenet}!decvax!cwruecmp!ccc