Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

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.

share|improve this question
3  
Do you know how to multiply two Gaussian integers mod(x)? –  poncho Feb 11 at 15:27
2  
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

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.