EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 8, Problem P8P
a.
Explanation of Solution
Given,
p = 5 and q = 11
n is calculated using the formula
Substitute, “5” for “p” and 11” for “q”:
Thus,
z is calculated using the formula
b.
Explanation of Solution
Given,
p = 5, q = 11 and e = 3
z is calculated using the formula
Substitute, “5” for “p” and 11” for “q”:
Thus,
c.
Explanation of Solution
Given,
p = 5, q = 11 and e = 3
z is calculated using the formula
Substitute, “5” for “p” and 11” for “q”:
Thus,
c.
Explanation of Solution
Given,
p = 5, q = 11 and e = 3
n is calculated using the formula
Substitute, “5” for “p” and 11” for “q”:
Thus,
We have m = 8, then
Cipher text
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Use Elgamal encryption with public prime modulus q=11, to encrypt the message m=3 (Find the
ciphertext only). Use your own values for not given parameters.
Show your steps in details and provide all your assumptions clearly.
Let's encrypt a message using RSA:
Choose p = 7 and q = 11, and then select e=13.
a.Compute d
b.Select plaintext message x=7. Produce the ciphertext y using the fast exponentiation
algorithm.
c. Decrypt the ciphertext (y) to verify that the initial plaintext (x) is produced. Again, please
use the fast exponentiation algorithm.
5. Your opponent uses RSA with n =
pq and encryption exponent e and
encrypts a message m. This yields the ciphertext
c = m mod n.
A
spy
tells
you that, for this message,
12345
=1 mod n.
Describe how to determine m. Note that you don't know p, q, 6(n),
or a decryption exponent d. However, you should find a de-
cryption exponent that works for this particular ciphertext.
Moreover,explain carefully why your decryption works (Your
explanation must include how the spy's information is used.)
Chapter 8 Solutions
EBK COMPUTER NETWORKING
Ch. 8 - Prob. R1RQCh. 8 - Prob. R2RQCh. 8 - Prob. R3RQCh. 8 - Prob. R4RQCh. 8 - Prob. R5RQCh. 8 - Prob. R6RQCh. 8 - Prob. R7RQCh. 8 - Prob. R8RQCh. 8 - Prob. R9RQCh. 8 - Prob. R10RQ
Ch. 8 - Prob. R11RQCh. 8 - Prob. R12RQCh. 8 - Prob. R13RQCh. 8 - Prob. R14RQCh. 8 - Prob. R15RQCh. 8 - Prob. R16RQCh. 8 - Prob. R17RQCh. 8 - Prob. R18RQCh. 8 - Prob. R19RQCh. 8 - Prob. R20RQCh. 8 - Prob. R21RQCh. 8 - Prob. R22RQCh. 8 - Prob. R23RQCh. 8 - Prob. R24RQCh. 8 - Prob. R25RQCh. 8 - Prob. R26RQCh. 8 - Prob. R27RQCh. 8 - Prob. R28RQCh. 8 - Prob. R29RQCh. 8 - Prob. R30RQCh. 8 - Prob. R31RQCh. 8 - Prob. R32RQCh. 8 - Prob. R33RQCh. 8 - Prob. P1PCh. 8 - Prob. P2PCh. 8 - Prob. P3PCh. 8 - Prob. P4PCh. 8 - Prob. P5PCh. 8 - Prob. P6PCh. 8 - Prob. P8PCh. 8 - Prob. P12PCh. 8 - Prob. P13PCh. 8 - Prob. P14PCh. 8 - Prob. P18PCh. 8 - Prob. P20PCh. 8 - Prob. P21PCh. 8 - Prob. P22PCh. 8 - Prob. P23P
Knowledge Booster
Similar questions
- For the public key PU=(33,3) and private key PR=(33,7). What will be the encrypted message if the plaintext is 4?arrow_forwardFor this problem you will perform RSA encryption and decryption with p = 13, q = 17, and e = 5 (not 3!). Show your work. Compute n and d. Encrypt the message m = 14 and give the ciphertext. Perform decryption on the ciphertext obtained in part (b) to get the plaintext message.arrow_forwardLet p = 37 and q = 31 in the RSA set up. A. What are all the valid exponents in this case? Pick a specific value of exponents, e1. For this exponent (public key) compute the corresponding private key d1. Take message x = random value from the set of allowed values? Define this set explicitly. For this x, compute the cipher y using the public key. Decrypt this y using the private key. Show all steps in the encryption and decryption process; use the fast method for exponentiation. I can do most of the problem except I am having problems proving the fast method, so a detailed explaination on how to do that would be appreciated. Thank you.arrow_forward
- Alice and Bob are using the ElGamal cipher with the parameters p = 53 and a = 2. Alice makes the mistake of using the same ephemeral key for two plaintexts, x1 and x2. The eavesdropper Eve suspects that x1 = 5. She sees the two ciphertexts y1 = 41 and y2 47 in transit; these are the encryptions of a1 and x2, respectively. a) What is the masking key kM? b) What is the plaintext x2?arrow_forwardAlice and Bob are using the ElIGamal cipher with the parameters p = 53 and a = 2. Alice makes the mistake of using the same ephemeral key for two plaintexts, x1 and x2. The eavesdropper Eve suspects that x = 5. She sees the two ciphertexts y1 = 41 and y2 = 47 in transit; these are the encryptions of x1 and a2, respectively. a) What is the masking key kM? b) What is the plaintext x2?arrow_forwardSuppose 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 =arrow_forward
- The problem at the center of RSA is finding the e’th root of the ciphertext c modulo N where N = pq is a product of (distinct) primes. This is hard to do for large N if you don’t know the factors p and q, but once you know p and q it becomes easy! Write a finction findRoot(c,e,p,q) which solves the equation xe ≡ c mod N for x where N = pqarrow_forwardLet M be the message to be sent by using RSA cryptosystem. If (n, e) is the public key and (n, d) is the private key, which of the following is the encryption function that will yield the cipher text that corresponds to M? О Е(M) — Ме mod (p - 1) (q — 1) О Е[M) — ма mod (p - 1)(q — 1) O E(M) = Me mod n О ЕМ) — Ма mod narrow_forwardUse the two prime numbers p 5 and q =13 in the first step to give ONE integrated example to show how the five steps in the basic process of RSA Cryptography works. Based on your example, demonstrate how the number 60 as an original message is encrypted into ciphertext and decrypted back correctly to the original message. If you need to choose a number in any step, you must choose it from the set {r e R: 8 Sx< 12}. You must show all detailed steps involved.arrow_forward
- 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 securearrow_forward8. Also, in the Caesar cipher you could not encrypt two different letters to be the same letter (meaning if “p" → "S" then nothing else can go to “S"). Is this true of the Vigen'ere cipher too?arrow_forwardCalculate H(K), H(M) and H(C) and the unicity distance for the following cryptographic system:First encrypt your plaintext using(a) a Vernam cipher with key lengths 5 and 7.and then encrypt the cyphertext by(b) 2 x 2 Hill cipher mod 29The cypher system is the combined cypher of (a) and (b).arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education