Problem with RSA - Programmers Heaven

#### Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

# Problem with RSA

Posts: 40Member
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?

• Posts: 1,784Member
: 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?
:
Think of it like (a^3)%n == (a^1)%n + (a^2)%n
I've done this, but I can't really remember the code or if the above is right...
• Posts: 40Member
: : 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?
: :
: Think of it like (a^3)%n == (a^1)%n + (a^2)%n
: I've done this, but I can't really remember the code or if the above is right...
: