1 QUICK PAGE IN AN HOUR

profileArun1990
Home>Homework Answsers>Information Systems homework help

 

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. 

    • 8 years ago
    • 7
    Report issue
    Answer(1)
    profile
    Miss Professor
    4.6 (26k+)
    4.6 (2k+)
    Chat

    Purchase the answer to view it

    blurred-text
    NOT RATED
    • attachment
      attachment.docx