Doing a signature with RSA alone on a long message would be too slow (presumably using cipher blocking chaining). Suppose we could do division quickly. Would it be reasonable to compute an RSA signature on a long message by first finding what the message equals, mod n, and signing that?