A secure email system is expected to provide confidentiality, sender's non-repudiation, and message integrity. Alice uses three keys to achieve this goal. The three keys are Alice's private key (KA), Bob's public key (Kg), and a randomlygenerated symmetric key (Ks).The encryption procedure is shown below:How can Bob 1) decrypt the data, 2) verify the message's integrity, and 3) verify the sender's non-repudiation? Describe the detailed steps (including the formulas) and show your work.KAm H(-) KA(mI am usingSHA-256KA(H(M))Ks()KB(*)KKsK.(m, KA(H(m))++KB(Ks)Internet34

Encryption: To prevent unwanted parties from reading a message, a readable message is transformed…

A secure email system is expected to provide confidentiality, sender's non-repudiation, and message integrity. Alice uses three keys to achieve this goal. The three keys are Alice's private key (KA), Bob's public key (Kg), and a randomly generated symmetric key (Kg). The encryption procedure is shown below: How can Bob 1) decrypt the data, 2) verify the message's integrity, and 3) verify the sender's non-repudiation? Describe the detailed steps (including the formulas) and show your work. m- I am using SHA-256 H() KA @ KA(9) KA(H(M)) ↓ + Ks Ks( KB() 4 K Ks 12] K₂(m, KA(H(m)) KB(Ks) Internet

A secure email system is expected to provide confidentiality, sender's non-repudiation, and message integrity. Alice uses three keys to achieve this goal. The three keys are Alice's private key (KA), Bob's public key (Kg), and a randomly generated symmetric key (Kg). The encryption procedure is shown below: How can Bob 1) decrypt the data, 2) verify the message's integrity, and 3) verify the sender's non-repudiation? Describe the detailed steps (including the formulas) and show your work. m- I am using SHA-256 H() KA @ KA(9) KA(H(M)) ↓ + Ks Ks( KB() 4 K Ks 12] K₂(m, KA(H(m)) KB(Ks) Internet

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Assume the cryptanalist has two pairs (x, y1) and (, y2) such that yl = DES(K, x) and y2 = DES(K,¤). Build a exhaustive key search which requires only 255 encryption to find out K. (This would be a slight improvement over the total number of 256 keys).
2. Suppose that Bob's public key is (p, a, ae) = (7481, 6, 5979). Alice receives the signed message (x, S1, S2) = (478, 1723, 7045) from Bob. Should she accept it?
Using a connected public key and private key, Alice and Bob may accomplish both secrecy and authentication.
Question 15 For Questions 15.1 - 15.2 consider the following integers: In a RSA cryptosystem with public- key (3233, 59), compute: 15.1 the private-key and give you final answer as an ordered pair (n, d).
. Q: There is no authentication in the Diffie-Hellman key-exchange protocol. By exploiting this property, a malicious third party, Chuck, can easily break into the key exchange taking place between Alice and Bob, and subsequently ruin the security. Explain how this would work.
Don’t copy answer
Eve uses RSA to send a message to Bob, using Bob's public key. Later, at a cock- tail party, Eve sees Bob and asks him if the message has arrived and Bob confirms it. After a few drinks, Eve asks Bob, "What was the ciphertext?" Bob gives the value of the ciphertext to Eve. Can this endanger the security of Bob's private key? Explain your answer.
Alice and Bob agree to use the prime p = 1373 and the base g = 2 for communications using the Elgamal public key cryptosystem. Bob chooses b = 716 as his private key, so his public key is B ≡ 2716 ≡ 469 (mod 1373). Alice encrypts the message m = 583 using the random element k = 877. What is the ciphertext (c1, c2) that Alice sends to Bob?
Computer Science * Alice and Bob are conducting Diffie-Hellman key exchange with the parameters p = 101 and a = 2. Their parameters are small and we decide to crack the key exchange. Suppose Alice is observed sending public key A = 79 and Bob sends public key B = 26. a) What is Alice's private key? b) What is Bob's private key? c) What is the shared secret? Alice and Bob are using the EIGamal cipher with the parameters p = 29 and a = 2. %3D Their parameters are small and we decide to crack the cipher. Suppose Alice is observed sending public ephemeral key kE 25 and Bob sends public key 3 = 4. %3D Alice is observed transmitting the ciphertext y = 13. a) What is the masking key kM? b) What is the plaintext?
. Q: There is no authentication in the Diffie-Hellman key-exchange protocol. By exploiting this property, a malicious third party, Chuck, can easily break into the key exchange taking place between Alice and Bob, and subsequently ruin the security. Explain how this would work.
Suppose Alice has a public key with modulus 815153 and encryption exponent 91. Eve intercepts a ciphertext 766247from Bob that was encrypted using this key. She calculates 766247⋅941^91(mod815153)=143804 and asks Alice to decrypt this message as an authentication test. Alice responds with the decrypted message 167698 Find the plaintext without factoring Alice’s modulus.
Question 9 Full explain this question and text typing work only thanks