Consider the affine cipher with key k = (k1, k2) whose encryption and decryption functions are given by (1.11) on page 43. Alice and Bob decide to use the prime p = 601 for their affine cipher. The value of p is public knowledge, and Eve intercepts the ciphertexts c1 = 324 and c2 = 381 and also manages to find out that the corresponding plaintexts are m1 = 387 and m2 = 491. Determine the private key and

Consider the affine cipher with key k = (k1, k2) whose encryption and decryption functions are given by (1.11) on page 43. Alice and Bob decide to use the prime p = 601 for their affine cipher. The value of p is public knowledge, and Eve intercepts the ciphertexts c1 = 324 and c2 = 381 and also manages to find out that the corresponding plaintexts are m1 = 387 and m2 = 491. Determine the private key and

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Consider the linear program max 10x – y s.t. -5x + 3y < 15 Зх — 5у <8 х, у 2 0 Use the simplex method to show that the problem is unbounded. (Show each iteration of the algorithm in the solution.)
Cc.33.
Answer number 5
This question is about Perfect Codes in Coding Theory: You may use that a perfect code of length 13 and distance 3 exists over GF(3). A soccer betting form contains a list of 13 matches. Next to each listed match there are three fill-in boxes which correspond to the following three possible guesses: “first team wins”, “second team wins” or “tied match”. The bettor checks one box for each match. Describe a strategy for filling out the smallest number of forms so that at least one of the forms contains at least 12 correct guesses. How many forms need to be filled out under this strategy?
Suppose (n, d) = (55, 3) is the private key of an RSA cryptosystem. If the received ciphertext is C = 49 what is the corresponding plaintext? O 3 4 10 14
a. Given p=23, q=7, and e=5, generate the public key (n,e) and the private key (n,d) using RSA Key generation algorithm. b. Given Bob's public key of (85, 7) and private key of (85, 55), show how Alice can encrypt m=7 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=8 received from Alice. Show the plaintext. d. Using the fast exponentiation method (page 182), determine 535 mod 47
The ciphertext 75 was obtained using the RSA algorithm with n = 437 and e = 3. You know the plaintext is either 8 or 9. Determine which it is without factoring n.
(a) Use the Euclidean algorithm to find gcd(131,326). (b) Use the above to find a solution to 131x+326y=gcd(131,326) (c) Does 131 have an inverse modulo 326? If so, find a value in {0,1,2,3,…,325} that is an inverse. If not, explain why not?
Solve the following system of linear congruences (explain and show each step towards your solu- tion). √ 4x+10y = 4 (mod 17) x + 2y = 5 (mod 17)
Problem 6. In class, we learned a simple symmetric shift cipher (a.k.a. Caesar cipher). The secret key K is an integer in {0, 1,..., 25}. As always, we map each alphabet letter .,Z} to an integer {0, 1,...,25}. The encryption and description are defined x = {A, B, by ... Enc(x, k) = (x + k) mod 26, Dec(x, k) = (x - k) mod 26. (a) As a warm-up, encrypt "CSCI IS COOL" using a Caesar cipher with k='F'. (b) Here's the ciphertext generated by the shift cipher. Find the corresponding plaintext (please explain the approach/strategy you used to find the key). IWXHFJTHIXDCXHTPHN