# Tag Info

Why not use Fermat's Little Theorem to calculate your inverse instead? ie $$a^{phi(m)-1}=a^{-1}\mod{m}$$ Although this would require repeated squaring (which is also vulnerable to side channel attacks) the number you would obtain from any attack would be the exponent, not the thing you were calculating the inverse of. As you would have already given ...