# Low exponent attack against RSA

According to this: http://www.cims.nyu.edu/~regev/teaching/lattices_fall_2004/ln/rsa.pdf

One can calculate the message m, if there was no padding scheme involved.

My question: is it possible to find m if the $n_a n_b n_c$ moduli are unknown?

Also: if one can see the encrypted version of a known plaintext, can one find the modulus?