Chris Farley - Missouri State University

Note that this can be found using the Euclidean Algorithm. Compute the private key, d, which is the multiplicative inverse of i.e., find an integer d with In general, solve for d in the equation The existence of d follows from the fact that if given two integers, a and b, where the then b is invertible (mod a) and b has a multiplicative inverse in. ................
................