Q.1 Calculate the following: a) Alice and Bob use the Diffie-Hellman key exchange technique with a common prime number 7 and 23. If Alice and Bob choose distinct secret integers as 3 and 6, respectively, then compute the shred secret key. b) Encrypt the plaintext (2) using RSA algorithm for the value p = 3, q = 11 and e = 7.

Q.1 Calculate the following: a) Alice and Bob use the Diffie-Hellman key exchange technique with a common prime number 7 and 23. If Alice and Bob choose distinct secret integers as 3 and 6, respectively, then compute the shred secret key. b) Encrypt the plaintext (2) using RSA algorithm for the value p = 3, q = 11 and e = 7.

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

dont dont dont post copied one sure strict report skip if dont know
A.Given p=25, q=9, and e=7, generate the public key (n,e) and the private key (n,d) using the RSA Key generation algorithm. (Use Excel for computations) b. Given Bob's public key of (85, 7) and private key of (85, 55), show how Alice can encrypt m=3 to send to Bob. Show the ciphertext. c. Given Bob's public key of (85, 7) and private key of (85, 55), show how Bob can decrypt the ciphertext y=2 received from Alice. Show the plaintext. d. Using the fast exponentiation method, determine 530 mod 47. Show your work.
Q1: Fill the empty spaces regarding RSA key generation: Algorithm: RSA Key Generation Output: public key: kpub=(n, e) and private key kpr = d 1. Choose two large primes p, q 2. Compute n = 3. Compute (n) ********* ****** 4. Select the public exponent e exponent e E (1, 2,.... (n)-1} such that gcd(e, (n)) = . 5. Compute the private key d such that d*e = 1 mod 6. RETURN Kpub=(n, e), kpr = d 1
21. RSA problem: given plaintext P, e, prime numbers p, q, compute ciphertext C. Decrypt C and verify you get plaintext P back.
Suppose that we decide to use the 8-bit ASCII encoding for alphabetic charac- ters with block size of one character (or letter). Using the RSA cryptosystem, let the public key is (2993, 217), where the two primes p = 41 and q = 73. Determine the private key (n, e) and encrypt some characters (not necessarily all characters - but make sure you include the first character "M" in the one you choose) of the word "MONEY", where M = 77, O = 79, N = 78, E = 69, Y = 89 according to the 8-bit ASCII encoding table. Show ALL workings.
Don’t copy answer
dont dont dont answer if you are not 100% sure else strict compliant skip if dont know
Cryptography
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?
Q5. Using RSA algorithm, Assume: p= 7, q = 13, e = 5, d = 29. a) What is the range of e? b) What is the public key and private key values? c) What is the ciphered text if the encrypted message = "P"?
Write the solution in detail:A) Encrypt the following message using poly-alphabetic cipher:Plaintext: “HELLO WORLD”Key:Shift the first letter three positions to its rightShift the second letter five positions to its rightShift the third letter seven-position to its left B) Using the same key, decrypt the following text:Cipher text= “vjv xwb wd”
Alice and Bob use the Diffie-Hellman key exchange technique with a common prime q=41and a primitive root α=2 . a) If Alice has private key XA =3,what is Alice’s public key? b) If Bob has private key XB = 7 ,what is Bob’s public key? c) What is the shared secret key?