4 Suppose that the Affine Cipher with the encryption function e(x) =9x + 3 mod 26 is used to encrypt a plaintext. Find the decryptionfunctionO 3y + 23O3y + 17O9y-3O9y + 17O 3y - 3If the Affine Cipher in the previous problem yields the followingciphertext, find the correspondingplaintext:truttreyO trubO treed(y) = cy + d mod 26O trueSABN

Answered: Image /qna-images/answer/1ced2ed2-62b6-47fb-82d2-6e0869e300d2.jpg

Suppose that the Affine Cipher with the encryption function e(x) = 9x + 3 mod 26 is used to encrypt a plaintext. Find the decryption function O 3y + 23 O 3y + 17 O9y-3 O 9y + 17 O 3y-3 d(y) = cy + d mod 26 If the Affine Cipher in the previous problem yields the following ciphertext, find the corresponding plaintext: SABN

Suppose that the Affine Cipher with the encryption function e(x) = 9x + 3 mod 26 is used to encrypt a plaintext. Find the decryption function O 3y + 23 O 3y + 17 O9y-3 O 9y + 17 O 3y-3 d(y) = cy + d mod 26 If the Affine Cipher in the previous problem yields the following ciphertext, find the corresponding plaintext: SABN

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter18: Deterministic Dynamic Programming

Section18.4: Resource-allocation Problems

Problem 3P

See similar textbooks

Similar questions

In order for the hash function (a * k)% M to yield separate values (no collisions) for the keys S E A R C H X M P L, a programme must be written to discover values of a and M, with M as little as feasible.A perfect hash function is the end result.
Suppose that the size of the hash table is 101. Further suppose that certain keys with the indices 15, 101, 116, 0 and 217 are to be inserted in this order into an initially empty hash table. Using modular arithmetic, find the indices in the hash table if quadratic probing is used?
Suppose you have a signature scheme S (which is correct and existentially unforgeable), and S can be used to sign any t-bit message. And you have a hash function H which outputs t bits and is collision-resistant. Consider a modified signature scheme S’ which can sign messages of unlimited length, where: S’.Sign(sk, m) = S.sign(sk, H(m)) Prove that this scheme is existentially unforgeable as long as S is existentially unforgeable and H is collision-resistant.
Suppose Alice computes the Secret suffix MAC (page 322: secret suffix MAC(x) = h(x || key)) for the message ”AM” with key “G” that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret suffix MAC computed by Alice? Show the MAC as the single character. What information is sent by Alice to Bob.
Q2. Determine the hash (in hexadecimal) of the message M using Davis-Meyer hash function. GIVEN MESSAGE IS DAB9 NOT AB12 PLEASE SHOW HOW TO DO THE PROBLEM USING DAB9• Block size = 8 bits• Hash size = 8 bits• Encryption function: Divide the key into two halves: LK and RK; Divide the plaintext into twohalves: LT and RT; Then ciphertext= LC||RC where LC=LK XOR RT; and RC = RK XOR LT;where LC, RC, LT, and RT are each 4 bits; Plaintext and ciphertext are each 8 bits.• g(H) = an 8-bit string that is equal to the complement of bits in H; For example, if H=A3 (Hexa)= 10100011 (binary); then g(H)= 01011100 • H0 = Initial hash = F4
Use python to solve the below question. Let p = 71; q = 89; n = pq; e = 3. First find the corresponding private RSA key d. Then compute the signature on m1 = 5416, m2 = 2397, and m3 = m1m2 (mod n) using the basic RSA operation (without hashing of the message). Show that the third signature is equivalent to the product of the first two signatures.
Can an AES key be shared secret encrypted? Justify your response Distinguish between hash and keyed hash See a real-world example of a one-keyed hash function.
An affine cipher has the form c = (am+b) mod n. Suppose m is an integer between 0 and 25, eachinteger representing a letter.(a) Let n = 26, a = 3, and b = 123. What is the ciphertext corresponding to the phrase THIS IS A CIPHERMESSAGE.(b) A requirement for a cipher is that every plaintext letter correspond to a different ciphertext letter. If either aand b is not relatively prime to n, does the affine cipher meet this property? Either prove it does or presenta counterexample.
Construct the Playfair matrix using the keyword SECRETKEY and then encrypt the message “thisisourfirsttest”. A) cl:fr:fr:mw:si:pb:es:cs:es B) cl:rf:rf:mw:si:pb:es:sc:es C) cl:fr:fr:mw:si:pb:es:sc:es D) cl:fr:fr:mw:si:pb:es:sc:se
Suppose that Alice and Bob agree to hash an integer by taking the sum of the digits modulo 1212. Also suppose Alice has a public key with modulus 304891304891 and exponent 7373 and Bob has a private key given by the primes 619619 and 799799 with exponent 2323. Give the ciphertext Bob would send to sign the message 6005460054.
Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”GD” (in ASCII) with key “H” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of characters is available at https://www.asciitable.com/ Take the Hexa equivalent and convert it to 8 bits each. For example character "A" is hexa 41 or 0100 0001 in bits) What is the Secret prefix MAC computed by Alice? Show the MAC as the single character. What information is sent by Alice to Bob?
Find the greatest common divisor of 26 and 5 using Euclidean algorithm. An encryption function is provided by an affine cipher ?:? → ?, ?(?) ≡ (5? + 8)??? 26, ? = {1,2, … , 26}Find the decryption key for the above affine cipher. Encrypt the message with the code 15and 19.