I am trying to implement RSA algorithm.
But I am not able to implement the step
x = (a^b)mod(n)
because the value exceeds the maximum limit of 'long' data type for large values of a and b. Is there any method to optimise this step?
Please help me with that.
0 · ·