Build an RSA encoder 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 e modulo 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.
Python &ndash; 5

Python 3 built-in function pow have third parameter. So Python 3 already have built-in RSA encoder

r=pow