Algorithms to find Inverses Algorithms to find Inverses a.mod n 1. Search 1.n-1 until an a-I is found with a.a" oa n 2. if (p(n) is known, then from Euler's Generalization a a9(n)-1 mod n 3. Otherwise use Extended Euclids algorithm for nverseAlgorithms to find Inverses • Algorithms to find Inverses a -1 mod n 1.Search 1,...,n-1 until an a-1 is found with a.a-1 mod n 2.if (n) is known, then from Euler's Generalization • a -1 = a  (n)-1 mod n 3.Otherwise use Extended Euclid's algorithm for inverse