00:01
In this question, we have been given an encrypted message which we have to solve using the cyclic alphabet encrypting code by shifting the letter by 17 positions.
00:12
So, in this case, we will shift each letter backwards by 17 positions and find the new alphabet which is present at that position.
00:22
The first letter given over here is w.
00:24
Let's shift it backwards by 17 position and check the new letter.
00:27
We have 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 14, 15, 16 and the 17 letter can be seen is f.
00:44
So the first decoded letter is going to be f.
00:48
Similarly solving for i, we can find the 17th letter to be 1, 2, 3, 4, 5.
00:58
6, 7, 8.
01:00
Since this is cyclic alphabet code, we can continue the counting from the last letter if we have reached the end of the alphabet...