Hi! i need help "exponentiating" large numbers
or, in general:
some number^(some really large number)
and i need the entire value so i can mod it properly.
i know that there are ways of doing it, but i dont understand any of them. can someone tell me how to do it without all sorts of greek letters?
yes, this is about the RSA algorithm...
If your modulus is less that 10 digits (even if the exponent is hundreds of digits in length) then this can be done using a calculator with 10 digit display.
Lookup the Russian Peasant Algorithm or Exponentiation Algorithm.
as CB stated:
for example:You don't need the entire value to mod it properly, what you do is break it down into stages mod-ing as you go along.