Computation in integers modulo the 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 calculate its multiplicative inverse a-1 (mod 127) with no more than 12 multiplications (comprising squaring operations).