安装 Steam
登录
|
语言
繁體中文(繁体中文)
日本語(日语)
한국어(韩语)
ไทย(泰语)
български(保加利亚语)
Čeština(捷克语)
Dansk(丹麦语)
Deutsch(德语)
English(英语)
Español-España(西班牙语 - 西班牙)
Español - Latinoamérica(西班牙语 - 拉丁美洲)
Ελληνικά(希腊语)
Français(法语)
Italiano(意大利语)
Bahasa Indonesia(印度尼西亚语)
Magyar(匈牙利语)
Nederlands(荷兰语)
Norsk(挪威语)
Polski(波兰语)
Português(葡萄牙语 - 葡萄牙)
Português-Brasil(葡萄牙语 - 巴西)
Română(罗马尼亚语)
Русский(俄语)
Suomi(芬兰语)
Svenska(瑞典语)
Türkçe(土耳其语)
Tiếng Việt(越南语)
Українська(乌克兰语)
报告翻译问题
I'll give you some hints, each one revealing more than the last:
#1:
If you look behind the indroductory blurb about steganography, you'll see different guides - one to binary and one to morse. Did you use them at all in this room yet?
#2:
Puzzle 07:
There are 3 different types of squares, what other system has 3 different characters?
Puzzle 08:
There are big letters and small letters, what other system has 2 different characters?
#3
Puzzle 07:
Morse code has 3 characters - Dot, Dash and Space
Puzzle 08:
Binary only uses 1s and 0s - Thats only 2 characters!
#4
Puzzle 07:
Square without top corner = Dot , Square without Bottom corner = Dash , Full Square = space. Read from top left corner to bottom right corner
Puzzle 08:
Big letter = 0 , Small letter = 1 . There are 25 characters in that statement. One you translate into binary, split into groups of 5.
#5 (Solutions!):
Puzzle 07:
From top left to bottom right corner, the boxes translate into morse code. Specifically they translate into - dot dot dot (space) dot dash (space) dash dash (space) dot dot dash (space) dot (space) dot dash dot dot. Using the guide, this translates into SAMUEL.
Puzzle 08:
Translate the statement into binary, using big letters = 0 and small letters = 1. It becomes 0000100000000100111001101. Split into five groups of five -> 00001 00000 00010 01110 01101. Find the numerical value for each group using the guide on the wall:
00001 = 1, 00000 = 0, 00010 = 2, 01110 = 14, 01101 = 13
Use these numbers to find the corresponding letters in the alphabet. 0=A, 1=B, 2=C, etc.-> 1=B , 0 = A , 2 = C, 14 = O , 13 = N, and you get the answer BACON
It's not about failure, but rather possibly the assumption that one could get to cryptography without at least a little math talent. Verbal skills can help with the simpler anagram-like puzzles, but if you need to count then you better know how to count (in binary or otherwise)!
In other words, for me 1-8 is broken and is unsolvable without spoilers. When I invest my time on a riddle which is not solvable because of misleading hints, it's VERY WRONG. Not to mention, that riddles 6, 7 and 8 are NOT examples of steganography...
Bacon Cipher. It uses 5-bit chunks and A = 00000, B = 00001, C = 00010 etc. But did they really want us to use Bacon to... solve a riddle introducing Bacon? Very weird and counter-intuitive to hints in the chamber :(
I'm sorry, What?!
That makes no sence at all.
I beg to someone to explain me how in name of all the gods can I get BACON from 1,0,2,14,13 whithout knowing wtf is a Bacon Cypher in advance?
2, 1, 3, 15, 14 (B, A, C, O, N) would be cool to decipher using plain alphabet (A=1, B=2, etc.), but it looks like they wanted from us to know Bacon to learn about Bacon :v
I've been wasting a lot of time on that one. Never came to my mind that I should be grouping the numbers 5 by 5 (and still don't know why it's the case to be honest).