Question

For affine cipher, the key is a = 17, b = 10 so the enciphering function...

For affine cipher, the key is a = 17, b = 10 so the enciphering function is

C(7,10)(p) = 17p + 10 mod 26.

a) Find the deciphering function for this cipher. Show your steps

b) If the ciphertext is AKV, what is the plaintext?

Homework Answers

Answer #1

a) Let denote plane text and denote cipher text.

Given the enciphering function

That is

Which implies

We have for any integer coprime to 26

Since 17 is coprime to 26, from above we get

Now

Then

b)

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
In Hill cipher, the ciphertext is computed by: C = PK (mod 26), where P is...
In Hill cipher, the ciphertext is computed by: C = PK (mod 26), where P is the plaintext matrix and K is the key. All computations are done in (mod 26) for English alphabet. (a) Explain how Eve can break the system if enough plaintext-ciphertext pairs are provided. (b) What is the type of this attack?
C Programming I have this function to i want to return the cipher text, but its...
C Programming I have this function to i want to return the cipher text, but its not working, can anyone try to see what i'm doing wrong. I need it to return the cipher text. char* vigenereCipher(char *plainText, char *k) { int i; char cipher; int cipherValue; int len = strlen(k); char *cipherText = (char *)malloc(sizeof(plainText) * sizeof(char)); //Loop through the length of the plain text string for (i = 0; i < strlen(plainText); i++) { //if the character is...
This question concerns block cipher modes. We will use a simple affine cipher, which can be...
This question concerns block cipher modes. We will use a simple affine cipher, which can be expressed in C as follows. char cipher(unsigned char block, char key) { return (key+11*block)%256; } Note that the block size is 8 bits, which is one byte (and one ASCII character). We will work with the fixed key 0x08. We now encrypt various plaintexts using modes for this cipher. In every case in which the mode requires an IV, the IV will be 0xAA....
Answer the following question: 1. a. Use an affine cipher x 7→ 3x + 1 (mod...
Answer the following question: 1. a. Use an affine cipher x 7→ 3x + 1 (mod 26) to encode “Baltimore”. b. Let a and b be integers. What does it mean to say a divides b? Provide a precise definition and include the proper notation. c. Let a, b, c, and n be integers with n 6= 0. Suppose that a ≡ b (mod n) and b ≡ c (mod n). Prove that a ≡ c (mod n). d. Use...
If a ciphertext is intercepted as follows: KSTPEIOEIEAYNMD, and you are highly confident that the Rail...
If a ciphertext is intercepted as follows: KSTPEIOEIEAYNMD, and you are highly confident that the Rail Fence cipher is used here, (10 points) (a). Find plaintext (b). What is the key?
For solving the problems, you are required to use the following formalization of the RSA public-key...
For solving the problems, you are required to use the following formalization of the RSA public-key cryptosystem. In the RSA public-key cryptosystem, each participants creates his public key and secret key according to the following steps: ·       Select two very large prime number p and q. The number of bits needed to represent p and q might be 1024. ·       Compute                n = pq                           (n) = (p – 1) (q – 1). The formula for (n) is owing to...
Vigenère Cipher. In the Vigenère Cipher, we use a special keyword to encrypt a message. We...
Vigenère Cipher. In the Vigenère Cipher, we use a special keyword to encrypt a message. We represent each letter of the alphabet as a number from 0-25. In order, we add each letter from the keyword to the message and mod by 26. If the keyword is shorter than the message, we simply repeat the keyword. For example, lets say that the message is HOWSTUFFWORKS and the keyword is CIPHER. The following table shows how we can find the final...
1) Make a substitution table corresponding for the Monoalphabetic Substitution corresponding to the key (G, Twelfth...
1) Make a substitution table corresponding for the Monoalphabetic Substitution corresponding to the key (G, Twelfth Night). Enter the bottom row of your substitution (called the cipher alphabet) below. Your input should be 26 capital letters with no spaces. 2) Encrypt the following message with Monoalphabetic Substitution using key (Q, As You Like It). Enter your ciphertext in 4-grams in capital letters. Message: If music be the food of love play on. 3) Decrypt the following ciphertext created with Monoalphabetic...
Below is an example of key generation, encryption, and decryption using RSA. For the examples below,...
Below is an example of key generation, encryption, and decryption using RSA. For the examples below, fill in the blanks to indicate what each part is or answer the question. Public key is (23, 11) What is 23 called? _______________, What is 11 called?_______________ Private key is (23, 13) What is 23 called?_______________, What is 13 called?_______________ 23 can be part of the public key because it is very hard to _______________ large prime numbers. ENCRYPT (m) = m^e mod...
Applied Cryptograph Program - Find a cryptographic key from Ciphertexts. Then decode the last ciphertext. In...
Applied Cryptograph Program - Find a cryptographic key from Ciphertexts. Then decode the last ciphertext. In this programming assignment, you will be responsible for determining a cryptographic key that is used to encrypt the 10 ciphertexts provided. In order to complete this programming assignment, you need to understand the problems inherent to the use of a single key to encrypt multiple messages The objective of the project is to demonstrate, from an attacker's perspective, how insecure the use of a...