RSA: Encrypting values bigger than the module Good morning!
This may be a stupid one, but still, I couldn't google the answer, so please consider answering it in 5 seconds and gaining a piece of rep :-)
I'm not doing well with mathematics, and there is a task for me to implement the RSA algorithm. In every paper I've seen, authors assume that the message $X$ encrypted is less than the module $N$, so that $X^e\quad mod\quad N$ allows to fully restore $X$ in the process of decryption.
However, I'm really keen to know what if my message is BIGGER than the module?
What's the right way to encrypt such a message?

The typical use of the RSA algorithm encrypts a symmetric key that is used to encrypt the actual message, and decrypt it on the receiving end.  Thus, only the symmetric key need be smaller than the log of the modulus.
