An approximate quantity of multiplications in $\mathbb{F}_p$ amounting the same bit complexity as one inversion in $\mathbb{F}_p$
The standard algorithm for inverting an element is using the extended Euclidean algorithm. You can read all about this connection on Wikipedia.