Question

Suppose the attacker has been logging the traffic between Alice and Bob. It is assumed that...

Suppose the attacker has been logging the traffic between Alice and Bob. It is assumed that the attacker can reliably distinguish between messages and their signatures (i.e., tags). In the process he found two messages x and y signed by Alice, i.e., he has pairs <x, tag(x)> and <y, tag(y)>. Suppose the signing function is

tag(m) = mk mod n

where k is the shared key between Alice and Bob.Show how he can fool Bob into believing that the message m was signed by Alice.

(Important hint 1: using the mathematical properties of RSA)

(Important hint 2: in other words, I let you prove whether the above MAC is secure or not, like our homework. Could you find a different message m’, and you can find t’)

0 0
Add a comment Improve this question Transcribed image text
Answer #1

I have completed this problem.Please give thumbs up if you like it

In this problem attacker was Trudy in which Trudy is attenticated to Bob as Alice and break the authentication using reflection attack and Bob thought that meassage was signed by Alice.

RSA mathematical function used g^xmod n but we used this function in diffie Hellman.

Mutual attenticatation can be achieved by public authority using digital signature.

# Distie Hellmam Sendeo. (Alice) Key Exchange : Secret key cryptogra Receiver (Bob) secoet of Bob iy iq the Bob déis secoet oo Mutual authentication. Com be achieved. being . Bibbie Hellmorom Key- - Alice) (Bob) - KABL A; RB KAB Re.(kas) challenge 1

Add a comment
Know the answer?
Add Answer to:
Suppose the attacker has been logging the traffic between Alice and Bob. It is assumed that...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • (Authentication with Alice cheating) Let’s assume Trudy is Alice’s little sister. Alice produces the message “Transfer...

    (Authentication with Alice cheating) Let’s assume Trudy is Alice’s little sister. Alice produces the message “Transfer $100,000 from Bob to Trudy’s account” and appends it with a valid signature sign(x) of Bob. She then claims that she received this message from Bob. Can Bob prove that he could not have signed this message? 1. In this problem, we will compare the security services provided by Digital Signatures (DS) and Message Authentication Codes (MAC). We assume that Trudy is able to...

  • 2. Alice is a student in CSE20. Having learned about the RSA cryptosystem in class, she...

    2. Alice is a student in CSE20. Having learned about the RSA cryptosystem in class, she decides to set-up her own public key as follows. She chooses the primes p=563 and q = 383, so that the modulus is N = 21 5629. She also chooses the encryption key e-49. She posts the num- bers N = 215629 and e-49 to her website. Bob, who is in love with Alice, desires to send her messages every hour. To do so,...

  • O-8. (15 points) Bob's simple toy RSA eryptosystem has public key kyub(n, e) (65,5), where n =p,-...

    o-8. (15 points) Bob's simple toy RSA eryptosystem has public key kyub(n, e) (65,5), where n =p,-5x13-65 and e-5. I. Describe the key pair generation procedure for Bob to generate his private key kor- d. With the above given parameters, use EEA to calculate d 2. Describe RSA encryption procedure that Alice uses to encrypt her plaintext message x to its above given parameters, what will be y? ciphertext y before sending the message to Bob. Suppose Alice's message x-...

  • Question1: Alice and Bob use the Diffie–Hellman key exchange technique with a common prime q =...

    Question1: Alice and Bob use the Diffie–Hellman key exchange technique with a common prime q = 1 5 7 and a primitive root a = 5. a. If Alice has a private key XA = 15, find her public key YA. b. If Bob has a private key XB = 27, find his public key YB. c. What is the shared secret key between Alice and Bob? Question2: Alice and Bob use the Diffie-Hellman key exchange technique with a common...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT