Alice publishes her RSA public key: modulus n= 27455269 and exponent e = 191. (a) Bob wants to send Alice the message m = 27453912. What ciphertext does Bob send to Alice? (b) Alice knows that her modulus factors into a product of two primes, one of which is p = 5011. Find a decryption exponent d for Alice. (c) Alice receives the ciphertext c= 5329179 from Bob. Decrypt the message.

Alice publishes her RSA public key: modulus n= 27455269 and exponent e = 191. (a) Bob wants to send Alice the message m = 27453912. What ciphertext does Bob send to Alice? (b) Alice knows that her modulus factors into a product of two primes, one of which is p = 5011. Find a decryption exponent d for Alice. (c) Alice receives the ciphertext c= 5329179 from Bob. Decrypt the message.

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

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?
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?
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.
Alice is to send a message to Bob using the RSA cryptosystem. Compute n (Bob's public key), a (Bob's private key), and the ciphertext given x (Alice) 4793 p (Bob) 7873 q (Bob) 5407 b (Bob) 5233
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.
Alice is to send a message to Bob using the RSA cryptosystem. Compute n (Bob's public key), a (Bob's private key), and the ciphertext. x (Alice) = 8430p (Bob) = 5651q (Bob) = 5557b (Bob) = 2677
Bob chooses p = 11 and e1 = 2 and d = 3 e2 = e1dn= 8, so the public keys are [2, 8 .11]and the private keys is 3. Alice chooses r = 4 and calculates C1 and C2 for the plaintext 7.
Bob's El Gamal prime number is p=907 and his secret key is a=16. Alice has encrypted x=13 for sending to Bob and her ciphertext is (37,♦). What is ♦ (mod p)? Select one: a. 512 b. 418 c. 253 d. 96 e. 419
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…
Alice publishes her RSA public key: modulus N = 2038667 and exponent e = 103.(i) Alice knows that her modulus factors into a product of two primes, one of which is p = 1301. Find a decryption exponent d for Alice.(ii) Alice receives the ciphertext c = 317730 from Bob. Decrypt the message. Confirm the correctness of your decrypted message by encrypting it again and comparing the ciphertext thus obtained with the given one in 3.7(c)
Alice and Bob has designed an RSA algorithm based on n = 152416431947009. Bob chooses the public key eB = 11. (a) Find the private key dB of Bob so that 0 < dB. Justify each step. (b) What should Alice do to send the message 123456789 to Bob? What message Bob receives? (c) What should Bob do to decrypt the message he receives from Alice? Please solve all part
Alice wants to send to all her friends, including Bob, a message using the RSA cryptosystem. She chooses secret primes p= 23, q = 31 and computes n = pq. (a) What is the smallest encryption key e > 1 that Alice can choose? What is the corresponding decryption key d? (b) What is the encryption of the message m = e you found in part (a)? 4 using the encryption key e= d= The encrypted message is