A generalization of Caesar's classic code can be defined as follows:
C = E ([a, b], P) = (ap + b) mod 26
Where
C = Cipher
P = Plain text
[a, b] = Key
Each encryption algorithm requires that the resulting encryption be unique. that's mean
E (K, P) ≠ E (k, q) Then p = q for
Is this condition for Caesar's generalized code? Violate this condition and then answer the following two questions
Give.