3
iamrp
5y

Q.14 - Suppose that R sends a msg 'm' which is digitally signed to M and the pair of private and public keys for M and R be denoted as K(x)- and K(x)+ for x=R,M respectively. Let K(x)(m) represent the encryption of 'm' with a key K(x) and H(m) is the message digest. Which of the following is the way of sending the msg 'm' along with the digital signature to M?
A. [m, K(R)+(H(m))]
B. [m, K(R)-(H(m))]
C. [m, K(M)-(H(m))]
D. [m, K(A)+(m)]
E. WOW, REALLY ?

Comments
  • 2
  • 2
    7:

    K(R) is sent over a separate channel as H(m), and m is not sent. Instead, a SHA-1 of m is sent and m is rebuilt on the other end using both the SHA-1 and H(m).
  • 2
    I'll like to use the "phone a friend" option.
    --- Hello, is that zuck?
    - Yes, this is zuck from FB.
    --- I have a question to ask on encrypted messages (...reads out question)
    - Wow, Really?
    --- Got it thanks

    Option 'E' my final answer!
  • 3
    E
    This is fucking unreadable
  • 1
    C.
    I don't think it's unreadable, it doesn't even use abstract algebraic black magic just conceptual functions and symbols.
Add Comment