Is the extended Euclidean algorithm the most efficient way to invert modulo p?

88 Views Asked by At

Is there any latest afford done, in this topic or is the EEA still the most efficient way to invert an element, say of size $2^{340}$?

If there is any better way, could you link me to the article or just tell me the google phrase?

If there is any special kind for $p\equiv - 3 \bmod 8$, this would be awesome.