# how to calculate power $n$ over Gaussian integers?

In the paper Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers the authors calculate $(4007621+145835\cdot i)^{7848211742013} \mod (x)$, please explain to me how to calculate power in case of Gaussian integers.

-
Do you know how to multiply two Gaussian integers mod(x)? –  poncho Feb 11 at 15:27
If you know how to multiply two Gaussian integers, then you can use the square and multiply algorithm. The exponent is an integer, no funny business there. –  tylo Feb 11 at 18:30