Affine Cipher is an example of a Monoalphabetic substitution cipher. The encryption process is substantially mathematical done by using the following formula: C = (P ∗ ?1 + ?2) mod 26. Where k1, k2 are two integers representing the key (selected randomly), C is the ciphertext value, and P is the plaintext value. Where C and P integers with values between 0 and 25. 1) Write an Octave programme to implement this system, run your programme using the Plaintext: “the quick brown fox jumped over the lazy dog”. Show the obtained ciphertext with the selected values of the keys k1 & k2. 2) Given that the plaintext “s” mapped to ciphertext “W”, plaintext “x” mapped to ciphertext “Z” when encrypted with Affine Cipher. Determine, mathematically, the values for the two keys K1 and K2. I need an octave code for the first part of this question, that i can just copy and paste. In addition, to an explanation of the steps done to get the final answers for both parts of the question, Thank you.
Affine Cipher is an example of a Monoalphabetic substitution cipher. The encryption process is substantially mathematical done by using the following formula:
C = (P ∗ ?1 + ?2) mod 26.
Where k1, k2 are two integers representing the key (selected randomly), C is the ciphertext value, and P is the plaintext value. Where C and P integers with values between 0 and 25.
1) Write an Octave programme to implement this system, run your programme using the Plaintext: “the quick brown fox jumped over the lazy dog”. Show the obtained ciphertext with the selected values of the keys k1 & k2.
2) Given that the plaintext “s” mapped to ciphertext “W”, plaintext “x” mapped to ciphertext “Z” when encrypted with Affine Cipher. Determine, mathematically, the values for the two keys K1 and K2.
I need an octave code for the first part of this question, that i can just copy and paste. In addition, to an explanation of the steps done to get the final answers for both parts of the question, Thank you.
Step by step
Solved in 3 steps
