1 QUICK PAGE IN AN HOUR

Doing a digital signature with RSA alone on a long message would be too slow (presumably using cipherblock 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 signing the result of the division mod n? Explain.

"Looking for a Similar Assignment? Order now and Get 10% Discount! Use Code "GET10" in your order"