Hello, last classes we have been working with a game on Khan academy. The game consists in solving many a mystery with some clues. But here we are going to tell you only wich problem has each clue and how we can solve the problem.
CLUE #1
The problem is that i found a message that is encripted and it can not be read directly.
That is why i decided to use the Ceaser chiper, get the most used letter and replace it with a. For this we used a Ceaser chiper simulator.
Clue #2
The problem is that we recived another encripted message, but encripted in a different way.
To solve this problem we need to find the key word, and change every letter of the key word for a number in each letter. The numbers must be in the same order, doesn't matter how short or long the word is.
Clue #3
The problem is that you found another peace of paper with an encrypted message in the train rails, but instead of letter it has numbers. The clue is not completed, because it's broken.
To solve the problem you will have to use Visual Telegraph, with shows you how every letter has a sequence of numbers.
Clue #4
The problem is that you found a bag with lots of encrypted messages written in different ways. They have something to do with the first newspaper that you found.
We saw that the encrypted message has something to do with binary numbers. Also the XOR operation was used to construct this code.
Here is a short video about binary numbers.
No comments:
Post a Comment