Your task is to build a function in any language that takes a message
m, an encryption
e, and a modulus
k (all positive integers), and takes
m to the power of
k. Your solution must not be a theoretical one, but one that would work on a reasonable computer such as your own, for RSA keys of currently used sizes such as 2048 bits.
Shortest code wins.