Three codes were hidden in the HTML source code of the Aglow post on the Investigate Ingress blog.
[1] eeovsseiifsxotsuaernvsceienxtnrwy
[2] 0100110000100000010100001100001010001101001101000001010100010000101100110101000010011000010011000101001100000110111
[3] 0iimxiixxxiicmiiccicixixxixim0xiixmicxxiximicxxixiicim0cicicixm0iciximcixxx
Code #1
Observations
33 characters, you can make out a few written numbers in there.
Make a 3×11 grid
e
e
o
v
s
s
e
i
i
f
s
x
o
t
s
u
a
e
r
n
v
s
c
e
i
e
n
x
t
n
r
w
y
Read down from the upper left E
evefoursixresistancetwosixsevenny
eve46resistance267ny
Make a 3×11 grid
e
e
o
v
s
s
e
i
i
f
s
x
o
t
s
u
a
e
r
n
v
s
c
e
i
e
n
x
t
n
r
w
y
Read down from the upper left E
evefoursixresistancetwosixsevenny
eve46resistance267ny
Code #2
Observations
115 characters, looks like binary but grouping of 8 is impossible.
[hint]You’ll need the help of a French Telegraph engineer[/hint]
115 characters in groups of five would make 23 characters. There is a cipher that is not used often that uses words with a length of 5 bits using 0 & 1. The cipher is called baudot code . You can use this tool to quickly decode baudot.
Make groups of 5
01001 10000 10000 00101 00001 10000 10100 01101 00110 10000 01010 10001 00001 01100 11010 10000 10011 00001 00110 00101 00110 00001 10111
Convert Baudot to text
DTTSETHFITRZENGTWEISIEQ
Convert all 2 letter numbers to numbers
dtt735tr0ng286eq
Using leet speach
dtt73strong286eq
115 characters in groups of five would make 23 characters. There is a cipher that is not used often that uses words with a length of 5 bits using 0 & 1. The cipher is called baudot code . You can use this tool to quickly decode baudot.
Make groups of 5
01001 10000 10000 00101 00001 10000 10100 01101 00110 10000 01010 10001 00001 01100 11010 10000 10011 00001 00110 00101 00110 00001 10111
Convert Baudot to text
DTTSETHFITRZENGTWEISIEQ
Convert all 2 letter numbers to numbers
dtt735tr0ng286eq
Using leet speach
dtt73strong286eq
Code #3
Observations
Roman numerals but a few 0 were added.
Notice that the string starts with a 0. This probably hints to binary. The first step is to split each characters of the string and convert them from roman numerals to numbers
0
0
i
1
i
1
m
1000
x
10
i
1
i
1
x
10
x
10
x
10
i
1
i
1
c
100
m
1000
i
1
i
1
c
100
c
100
i
1
c
100
i
1
x
10
i
1
x
10
x
10
i
1
x
10
i
1
m
1000
0
0
x
10
i
1
i
1
x
10
m
1000
i
1
c
100
x
10
x
10
i
1
x
10
i
1
m
1000
i
1
c
100
x
10
x
10
i
1
x
10
i
1
i
1
c
100
i
1
m
1000
0
0
c
100
i
1
c
100
i
1
c
100
i
1
x
10
m
1000
0
0
i
1
c
100
i
1
x
10
i
1
m
1000
c
100
i
1
x
10
x
10
x
10
You now have a long string of 0 & 1
011100010111010101110010001110010011001101101011011000010111010001100101011011000110010101101110011000010011001100110100001100110110001001101010
Make groups of 8
01110001 01110101 01110010 00111001 00110011 01101011 01100001 01110100 01100101 01101100 01100101 01101110 01100001 00110011 00110100 00110011 01100010 01101010
Convert binary to Ascii
qur93katelena343bj
Notice that the string starts with a 0. This probably hints to binary. The first step is to split each characters of the string and convert them from roman numerals to numbers
0
0
i
1
i
1
m
1000
x
10
i
1
i
1
x
10
x
10
x
10
i
1
i
1
c
100
m
1000
i
1
i
1
c
100
c
100
i
1
c
100
i
1
x
10
i
1
x
10
x
10
i
1
x
10
i
1
m
1000
0
0
x
10
i
1
i
1
x
10
m
1000
i
1
c
100
x
10
x
10
i
1
x
10
i
1
m
1000
i
1
c
100
x
10
x
10
i
1
x
10
i
1
i
1
c
100
i
1
m
1000
0
0
c
100
i
1
c
100
i
1
c
100
i
1
x
10
m
1000
0
0
i
1
c
100
i
1
x
10
i
1
m
1000
c
100
i
1
x
10
x
10
x
10
You now have a long string of 0 & 1
011100010111010101110010001110010011001101101011011000010111010001100101011011000110010101101110011000010011001100110100001100110110001001101010
Make groups of 8
01110001 01110101 01110010 00111001 00110011 01101011 01100001 01110100 01100101 01101100 01100101 01101110 01100001 00110011 00110100 00110011 01100010 01101010
Convert binary to Ascii
qur93katelena343bj
Related