Doing a digital signature with RSA alone on a long message, m, would be too slow (presumably using cipher block chaining). Suppose we could do division quickly. Would it be reasonable to compute an RSA based digital signature on a long message by first finding what the message equals, mod n, and then sign the result of the message division mod n? Your response needs to include a justification with citations. (Hint: Is signing (m mod n) as secure as signing (m))Doing a digital signature with RSA alone on a long message, m, would be too slow (presumably using cipher block chaining). Suppose we could do division quickly. Would it be reasonable to compute an RSA based digital signature on a long message by first finding what the message equals, mod n, and then sign the result of the message division mod n? Your response needs to include a justification with citations. (Hint: Is signing (m mod n) as secure as signing (m))

This is network question please dont copy other answers