Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
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 · ·