Question: 1. Consider an encryption for English letters that are represented by integers {0, 1, 2, ..., 25}. We choose two random integers a and b

1. Consider an encryption for English letters that are represented by integers {0, 1, 2, ..., 25}. We choose two random integers a and b as the key: K=(a,b). Then, for any plaintext P in {0, 1, 2, ..., 25}, the encryption is defined by C = (a*P + b) mod 26.

(1a) For K=(7, 15), how to decrypt a ciphertext C? Give an equation. (1b) How many different and valid K=(a,b) exist?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!