Question: Suppose we have a Caesar shift cipher that shifts the English alphabet by N places, and a plaintext to apply it to . We then
Suppose we have a Caesar shift cipher that shifts the English alphabet by N places, and a plaintext to apply it to We then apply the cipher times each time to the output of the last time. When we're done, we see that we landed on the plaintext we started with!
Which of the following is true?
Group of answer choices
N could be any number.
N must be even.
N must be odd.
N must be a multiple of
This can't happen for any value of N
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
