Alice and Bob use the ElGamal scheme with a common prime q= 131 and a primitive root a = 6. Let Bob's publickey be YB= 3.A. What is the ciphertext of M=9 if Alice chooses the random integer k=4?B. If Alice uses the same k to encrypt two messages M1 and M2 as (12, 65) and (12, 64), what is the relationbetween Mj and M2?

Answered: В. If Alice uses the same k to encrypt…

В. If Alice uses the same k to encrypt two messages M1 and M2 as (12, 65) and (12, 64), what is the relation between M, and M2?

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

Related questions

Q: R6. Suppose N people want to communicate with each of N-1 other people using symmetric key…

Q: Suppose Alice has a public key generated from the primes 409 and 617 with exponent 29. She receives…

A: Decryption of a message: A message can be decrypted using the private key d. Formula: Message m = cd…

Q: Q1. Determine the hash (in hexadecimal) of the message M using Martyas-Meyer-Oseas hash function.…

A: Given according to question: Block size = 8 bits Hash size = 8 bits Encryption function: Divide…

Q: Question 1 : a) Generate the public private key pairs for Bob using the following values Bob P = 19…

A: RSA algorithm: Choose 2 large prime numbers P and Q Calculate n=P×Q Select a public key or…

Q: CRYPYOGRAPHY (Suppose that Alice the encrypts same plaintext m to Bob and charles who have their RSA…

A: The Answer is in Below Steps:-

Q: Given the public key (15, 5) and private key (15,11), and the following hash algorithm, with input…

Q: Suppose that the Affine Cipher with the encryption function e(x) = 9x + 3 mod 26 is used to encrypt…

Q: 2.1 Suppose that Bob and Alice have access to a public key system that makes their public keys…

A: Bob has a key KB- (private key) and KB+ (public key) Bob publishes his public key KB+ and Alice…

Q: Question 5 a) Roger wants to send Simon a message asking him to transfer RM6,000 to his account.…

Q: For Diffie Hellman Key exchange protocol, following are given: Generator g=11 Prime p=23 Alice…

A: ANSWER GIVEN DATA: Alice and Bob want to use the Diffie Hellman Key, given that Alice and Bob, Prime…

Q: tocol. a. Given p = 13, g = 4, SA = 4, and SB = 5. Compute TA, TB, and the shared key k using…

A: prime number p = 13 primitive root α = 4 A's private key SA = 4 A's public key bis taken TA =…

Q: Bob chooses p = 11 and e1 = 2 and d = 3 e2 = e1dn= 8, so the public keys are [2, 8 .11]and the…

A: Step 1 The solution is given in the below step

Q: that Bob's RSA modulus is mB = 187. (a) If Bob's public exponent is eg = 13 and Alice wants to…

A: (a) To encode the message-signature pair to ship off Bob Alice utilizes Bob's public keymatch…

Q: Explain the key stream generator (LFSR) given by the recurrence relation S+5 = (S + S+2 + Si43) mod…

A: Linear feedback shift register: A linear feedback shift register is a special type of recurrence…

Q: Alice uses a shift cipher with a shift of 4 to encrypt her message to Bob. If the ciphertext she…

A: a b c d e f g h i j 0 1 2 3 4 5 6 7 8 9 k l m n o p q r s t 10 11 12 13 14 15 16 17 18 19…

Q: Q2: Based on Diffie-Hellman protocol, if the public key is g = 23,p = 449, and c = 141. Find the…

A: a=20

Q: In the existential forgery attack on the schoolbook RSA digital signature protocol, Oscar can forge…

A: Well, if he could control the message, that is, we believe that he can't do that, or at least, he…

Q: A Man-in-the-Middle attack on the Diffie-Hellman key exchange protocol may be effectively carried…

A: Attainment of a guy in the city center The attacker must establish a secret with the necessary…

Q: Show a situation that the above algorithm is vulnerable to the man/women-in-the-middle attack.

A: Bob has an RSA key pair (PU, PK), where PU is his public key and PK is the private key, design an…

Q: How

A: She compares h(M) to DSeB mod N.

Q: When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers…

A: Alice can use the fragmentation scheme as in computer networks. Let's say the message size is…

Q: For that, Koushik must derive his own public key and private key pair from the values p = 23 and q =…

A: Answer: Given P=23 and Q=107 where p and q are two prime number and find E and D using RSA…

Q: Suppose that Bob and Alice have access to a public key system that makes their public keys available…

A: We are going to use public key system to make a encrypted communication between two parties Alice…

Q: Let p = 359 and q = 499. Show how to create public and private keys of RSA encryption using these…

A: Answer : Asymmetric algorithem Asymmetric algorithm has two different keys public and private…

Q: Determine the hash (in hexadecimal) of the message M using Martyas-Meyer-Oseas hash function.…

A: Given data is GIVEN MESSAGE IS DAB9 NOT AB12 PLEASE SHOW HOW TO DO THE PROBLEM USING DAB9• Block…

Q: Q2: Based on Diffie-Hellman protocol, if the public key is p = 827, and c = 532. The private key a =…

A: Below I have Provided the handwritten solution to the given question:

Q: Q2: Based on Diffie-Hellman protocol, if the public key is g = 23,p = 797, and c = 512. Find the…

A: Diffie Hellman key exchange is a public key exchange method. In this method, a pair of public and…

Q: In diffie hellman key exchange is based on the use prime number q = 353 and primtive root of 353 ,…

A: Key exchange is based on the use of the prime number q = 353 and a primitive root of 353, in this…

Q: Alice signs the hash of a message. Suppose her hash function satisfies h(x) = 2ª (mod 101) and 1<…

A: Hash function: Hash function appeared in all information security application. It is a mathematical…

Q: 5. As shown in the figure below, we see how Alice can send Bob a singed message. If Trudy replaces…

A: Attached the answer in the form of a typed image.Please look into it.

Q: B. If Alice uses the same k to encrypt two messages M₁ and M₂ as (12, 65) and (12, 64), what is the…

A: The answer is

Q: [g mod p, {R1}Bob]Alice [g mod p, {R1,R2,h(gab mod p)}Alice]Bob Session key: h(R1,R2,gab mod p)…

A: Introduction: We have to explain why this protocol is or is not subject to a man-in-the-middle…

Q: Given the following table describing the procedure for Alice to send a signed message with RSA…

A: Answer :

Q: Suppose that you receive a digital certificate that contains M and (h(M)]CA, where M = (Alice,…

A: Identifying the sender of certificate in a digital certificate The digital certificate contains M…

Q: Prove that in RSA with public key (n,e) and n=pq, the amount of plaintexts x, with Ec(x)=x, is dpdq,…

A: Answer: I have given answered in the handwritten format in brief explanation

Q: Alice and Bob use the ElGamal scheme with a common prime q=131 and a primitive root a=6. Let Bob's…

A: Your answer is given below:

Q: a) How can integrity and origin-authentication in messages sent between them be achieved while only…

A: Integrity - It means that the same message is received which was send, means there is no alteration…

Q: Q5. DHKE protocol Use these toy parameters to demonstrate how DHKE (Diffie-Hellman Key Exchange)…

Q: 4. Suppose the prime p = DepRob want to use the Diffie-Hellman key agreement protocol to 251 and…

A: According to the information given:- We have to use the Diffie-Hellman key are to an 8-bit keyword…

Q: 3. In a public key system using Rivest-Shamir-Adlemen (RSA), Eve intercepts a ciphertext C = 33 sent…

A: Answer is given below.

Q: Using a connected public key and private key, Alice and Bob may accomplish both secrecy and…

A: Introduction: Asymmetric key cryptography is the use of both a public and a private key for…

Q: Question 15 For Questions 15.1 - 15.2 consider the following integers: In a RSA cryptosystem with…

A: RSA Algorithm: Choose 2 large prime numbers p and q such that…

Q: PLEASE FILL OUT THE CHART GIVEN BELOW Man-in-the-middle attack when Alice and Bob employ…

A: Here we have to provide the solution for a given problem.

Q: Pretend you are Alice and have agreed with Bob to carry out Diffie-Hellman key exchange with…

A: a) The value we will send to Bob is given by: ......................[used…

Q: We assume Bob wants to distribute his session key Ks to Alice.

A: Access control is a process to determine "who does what to what," based on a policy. Policy should…

Concept explainers

Fundamentals of blockchaining

In a business network, the tracking assets and the process of recording transactions are facilitated by the shared immutable ledger called a blockchain. Assets are of two types they are tangible and intangible. The tangible assets are land, house, cash, etc. The intangible assets are copyrights, branding, properties patterns, intellectual property, etc. On a blockchain network, anything that has a value can be tracked and it can be traded.

Question

Alice and Bob use the ElGamal scheme with a common prime q= 131 and a primitive root a = 6. Let Bob's public
key be YB= 3.
A. What is the ciphertext of M=9 if Alice chooses the random integer k=4?
B. If Alice uses the same k to encrypt two messages M1 and M2 as (12, 65) and (12, 64), what is the relation
between Mj and M2?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Alice wants to securely send Bob an arbitrary numberM from the set {0, 1, . . . , N − 1} for some positive integer N. She wants to have ascheme with perfect secrecy. She heard of the One Time Pad (OTP), but OTP isfor bitstrings, not numbers. She decides to use the following scheme. The key spaceis {0, 1, . . . , N − 1}. A ciphertext C for M is computed as (M + K) mod N anddecryption performs (C − K) mod N.Prove that this scheme is perfectly secure
In the Diffie-Hellman Protocol, each participant selects a secret number x and sends the other participant αx mod q for some public number α. What would happen if the participants sent each other αx for some public number αinstead? Give at least one method Alice and Bob could use for agreeing on a key. Can Eve break your system without finding the secret numbers? Can Eve find the secret numbers? In TLS, why is there a separate Change Cipher Spec Protocol, rather than including a change_cipher_spec message in the Handshake Protocol?
In the ElGamal cryptosystem, Alice and Bob use p = 17 and α = 3. Bobchooses his secret to be a = 6, so β = 15. Alice sends the ciphertext (r, t) = (7, 6). Determine the plaintext m.
The Lingala Language of Republic of Congo has 35 letters. Consider an Affine cipher, which encrypts each letter according to the rule: C=(p×k1+k2) mod 35. Here C, p, k1, and k2 are each members in the range 0 to 34, where C represents the ciphertext letter, p the plaintext letter, and k1 and k2 are constant keys. How many possible keys does this affine system have? Explain in details.
In a RSA cryptosystem, a participant uses two prime numbers p and qis 17 and 11 respectively to generate his/her public key and privat keys. If the public key of participant is 7 and cipher text(C) is 11, then the original message(M) is. Correct answer will be appreciated , else downvoted.
In the El Gamal cryptosystem, Alice and Bob use p = 17 and α = 3. Bobchooses his secret to be a = 6, so β = 15. Alice sends the ciphertext (r, t) = (7, 6). Determinethe plaintext m.
We consider ElGamal cryptosystem with public prime p = 53 and generator g = 2. Let h = 16 be Bob’s public-key (his private key x is unknown, h = g^x ). Alice encrypted message m with Bob’s public key and sent the corresponding ciphertext to Bob: (C1 ,C2 ) = (15, 50). You intercepted this ciphertext. Can you break the encryption and recover the original message m? Hint: Both g and h are very small numbers, can you deduce private key x?
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?
Alice and Bod have decided to use a symmetric encryption algorithm. They have someassumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical valuesof corresponding message and key letters are added together, modulo 26. For example, if the plaintext is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), thenfor each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) a) Write a program in Python, C/C++ or JavaScript to…
Suppose that Alice and Bob agree to hash an integer by taking the sum of the digits modulo 1212. Also suppose Alice has a public key with modulus 304891304891 and exponent 7373 and Bob has a private key given by the primes 619619 and 799799 with exponent 2323. Give the ciphertext Bob would send to sign the message 6005460054.
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)
Suppose your RSA public key is PK: {n, e} = {13861, 37}. Your friend sends you a ciphertext C = 9908. But unfortunately you have forgotten your private key, now you have to crack it yourself.a) Write down a possible condition of factors p and q.p= q=b) What is your private key SK: {d}?d=c) What is the plaintext of your friend’s message?The plaintext M =d) Suppose the plaintext M is a 12-digit number consisting of a prefix “19” and 1234567890. What is the corresponding ciphertext? Since M is greater than n, you only need to encrypt four digits at a time. Ignore redundant zeros. e.g., 0001 = 1. The result should contain three integers.The ciphertext C0 =