Algorithms to find Inverses Algorithms to find Inverses a-l mod n 1. Search 1..n-1 until an a- l is found with aa. mod n 2.if o(n)is known, then from Euler's Generalization a1=aq(n)-1 d 3. Otherwise use Extended euclids algorithm for InverseAlgorithms 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