We have p and q which are distinct primes congruent to 1 mod 4. Then we have n = p*q.
Do you know any algorith for calculating square roots for the decryption in this case? I'm asking for some explanation how to calculate or some pseudocode. Thanks in advance