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

Related questions

Q: Encrypt : QuiZ Cresar cypher is OVER using the with $ (p) = p+18 (mod 2b Let AこO, B=, Z=25

A: Given plain text is QUIZ IS OVER Also given f(p) = p+18(mod 26) So, key is 18

Q: 3. Cryptography: The following message was encoded with the matrix B shown below. Decode the…

A: To decode the message, we need to use the inverse of the matrix B. The inverse of a matrix is…

Q: A shortcoming of using an elliptic curve E(Fp) for cryptography is the fact that it takes two…

A: Algorithm:Initialize Parameters: Define the prime field p, coefficients a and b of the elliptic…

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: Messages are to be encoded using the RSA method, and the primes chosen are p = 13 and q = 23, so…

A: Given, p = 13 q = 23 n = p*q = 299 Φ(n) = (p-1)*(q-1) = (12*22) = 264 e = 13

Q: Find the Sum of the Digits of the Number Recursively Write a python program for this statement.

A: Given: Find the Sum of the Digits of the Number Recursively Write a python program for this…

Q: 2.8. Alice and Bob agree to use the prime p = 1373 and the base g = 2 for communications using the…

A: According to the Bartleby guideline, we are supposed to answer only 3 sub part of a question at a…

Q: Digital Signature using the RSA algorithm: Alice is sending an integer value mA = 4 to Bob with…

A: Given: Public key of Alice e=5 Private key of Alice d=11 Message mA=4 n=14 Computation: The…

Q: Exercise 1 (The RSA basics (. Alice forms a public key for the "textbook" RSA public-key encryption…

A: Dear Student, The answer to each question with sufficient explaination is given below -

Q: 1. Please apply columnar transposition cipher to encrypt the message "a digital computer is a…

A: Columnar Transposition Cipher: Columnar Transposition is the process of writing plaintext in rows…

Q: Please explain the problem in detail so that I can understand.

A: 1. Monoalphabetic Cipher Given Message: "This is a secret message" Now we have to encrypt the…

Q: E(m, K;) m = She produces: She sends Bob: m. swer the following: a. What type of cryptosystem are…

A: The answer given as below:

Question

100%

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.

Expert Solution

This question has been solved!

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

SEE SOLUTION Check out a sample Q&A here

Step 1: Solution to the Cryptographic Calculations

VIEW

Step 2: Solution for part A and B

VIEW

Solution

VIEW

Step by step

Solved in 3 steps with 3 images

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

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.
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
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?
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?
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.
dont post copied or existing one skip skip if dont know
Alice and Bod have decided to use a symmetric encryption algorithm. They have some assumptions 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 values of corresponding message and key letters are added together, modulo 26. For example, if the plain text 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”), then for 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) Write a program in Python, C/C++ or JavaScript to…
You witness Alice and Bob agree on a secret key using the Diffie-Hellman key exchange. Alice andBob chose p = 97 and g = 5. Alice send Bob the number 3 and Bob sent Alice the number 7. Bruteforce crack their code: What is the secret key that Alice and Bob agreed upon? What were theirsecret keys?