Computation in integers modulo a prime number p yields field GF(p). The operation that tends to be rather expensive in GF(p) is computation of multiplicative inverses. Illustrate that for every non-zero element aεGF(127), we can determine multiplicative inverse a-1 (mod 127) with no more than 12 multiplications (including squaring operations).