Q2. Part -1. This question is about placement of encryption function and key exchangeDiscuss Diffie-Hellman key exchange protocols to enable two users to securely exchange akey that can be used for subsequent encryption of messages.In Diffie-Hellman key exchange is based on the use of the prime number q = 353 and aprimitive root of 353, in this case a = 3. A and B select secret keys XA = 97 and XB 233,respectively. Use this information to compute public key for both sender A and Receiver B.Once the public key is calculated then compute a common secrete key.C.d.

Diffie Hellman (DH) key trade calculation is a strategy for safely trading cryptographic keys over a…

Answered: Discuss Diffie-Hellman key exchange…

Discuss Diffie-Hellman key exchange protocols to enable two users to securely exchange a key that can be used for subsequent encryption of messages. C.

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

Consider the case of Alice sending a message, m, to Bob. Both Alice and Bob use public key cryptography and each has a public and private key as described in the text. The figure attached below shows the operations that Alice must perform to provide confidentiality, authentication, and integrity when sending a message to Bob over the network. We can use either symmetric key or public key cryptography to encrypt a message. For our purposes, either technique will encrypt the message, and applying both doesn't make it "more secure". Also, we can assume that the session key would remain a secret so the fact that it is discarded does not make it "more secure". Why do we use a session key, Ks, instead of relying only on public key Cryptography? In other words, why do we use both public key and symmetric key cryptography?
A cipher suite is a choice of algorithms for key exchange, authentication and encryption to be used together in TLS. Cipher suites are specified by an abbreviation such as the following: “ADH-DES-CBC-SHA”. Search online and find one example of a cipher suite used in TLS 1.3. Write the name of the cipher suite; then, for each component, write what the abbreviation stands for and for which cryptographic task that algorithm is used in that suite.
(do completely) Question 3 One way to solve the key distribution problem is to use a line from a book that both the sender and the receiver possess. Consider the following ciphertext: B G L C J J Y Y N U D N T G T The key used to encrypt the original message is derived from the first letter of the first four words in the first sentence of The Hunt for the Red October, written by Tom Clancy. “Captain First Rank Marko Ramius of the Soviet Navy was dressed for the Arctic conditions normal to the Northen Fleet submarine base at Polyarnyy.” (Hint: The encoder has removed the blanks between the ciphertext. The key used here might not be a meaningful English word. However the plaintext is a meaningful English phrase). (a) Retrieve the key. (b) Retrieve the whole plaintext.
1. Asymmetric Encryption and Message Authentication: a) The primitive root of a prime number is the basic principle of Diffie-Hellman. i) Is 3 the primitive root of 11? Show the proof with your calculation. ii) What are the important criteria for selecting a prime number in cryptography? Is 11 a good choice for such a purpose? b) Find the parameters stated using the Diffie-Hellman methods, given the user A and B shared a prime number and its primitive root of 23 and 5, respectively. i) If user A public key value is 8, find the A’s private key. ii) If user B public key value is 19, what is the common secret key? c) In the following scenario, we will compare the security services that are given by digital signatures (DS) and message authentication codes (MAC). We assume that James can read all messages send from Chan to Badrul and the other way around, too. James has no knowledge of any keys but the public one in the case of DS. State whether and…
Question2 part 1. d. In Diffie-Hellman key exchange is based on the use of the prime number q = 353 and aprimitive root of 353, in this case α = 3. A and B select secret keys XA = 97 and XB = 233,respectively. Use this information to compute public key for both sender A and Receiver B.Once the public key is calculated then compute a common secrete key.
Consider the ElGamal signature scheme. Let Bob’s private key be Kpr = (d) = (67) and the corresponding public key Kpub = (p, α, β) = (97,23,15). Verify if both these messages originated from Bob You receive the following message and signatures (x, r, s) = (22, 37, 33) (x, r, x) = (82, 13, 65)
Question 2: You are Alice. Bob publishes his ElGamal public key (q, a, ya) = (101, 2, 14). You desire to send the secret message “CALL ME” to Bob. Using the equivalence A = 01, B = 02, and so on up to Z = 26, you encode the message into the number 03 01 12 12 13 05. Regarding each of these two-digit numbers as a plaintext block, compute the message that you will send to Bob using his public key. This requires you to pick a “random” number k; use k = 32. You are Bob. You get a message from Alice. You like Alice a lot, so you are eager to read the message. Use your secret key (101, 2, 10) to decrypt Alice’s message. Notice that you don’t need to know what value of k Alice used in order to do this.
Need help with a Which description about the Diffie-Hellman Protocol is NOT correct? A. Diffie-Hellman Protocol is used to negotiate a key over a public channel. B. The base g and modulus p are publicly known . C. Diffie-Hellman Protocol authenticates each party. D. Diffie-Hellman Protocol is vulnerable to the Man-In-The-Middle Attack.
Let the encryption keyword of a monoalphabetic cipher be ROME. (a) Show the encryption key in the table form. (b) Show the decryption key in the table form. (c) Obtain ciphertext for the following message sentence: Rome wasn’t built in a day.
Question 1. Understand the following problem scenarios and draw their structural diagrams.    a) It is possible to use a hash function but no encryption for message authentication. The technique assumes that the two communicating parties (A and B) share a common secret value S (Salt). A computes the hash value over the concatenation of M and S and appends the resulting hash value to M. Because B possesses, it can recomputed the hash value to verify. Because the secret value itself is not sent, an adversary cannot modify an intercepted message and cannot generate a false message. B) Only the hash code is encrypted, using symmetric encryption. This reduces the processing burden for those applications that do not require confidentiality.
Question 1. Understand the following problem scenarios and draw their structural diagrams.    a) It is possible to use a hash function but no encryption for message authentication. The technique assumes that the two communicating parties (A and B) share a common secret value S (Salt). A computes the hash value over the concatenation of M and S and appends the resulting hash value to M. Because B possesses, it can recomputed the hash value to verify. Because the secret value itself is not sent, an adversary cannot modify an intercepted message and cannot generate a false message. b) Only the hash code is encrypted, using symmetric encryption. This reduces the processing burden for those applications that do not require confidentiality. please give me a good
Question 1. Understand the following problem scenarios and draw their structural diagrams.     a) It is possible to use a hash function but no encryption for message authentication. The technique assumes that the two communicating parties (A and B) share a common secret value S (Salt). A computes the hash value over the concatenation of M and S and appends the resulting hash value to M. Because B possesses, it can recomputed the hash value to verify. Because the secret value itself is not sent, an adversary cannot modify an intercepted message and cannot generate a false message.