Three codes were found in the All Zeroes post on the Investigate Ingress blog.

`[1] hga430368kd`

`[2] jppypl25qxx3fyy2fpvuy3jucyfuxm`

`[3] &&&.^^^.&.%.^^.%.@.%.^^.#.*.@@.*.&&&.&`

Code #1
Observations
You can see the passcode format, you’ll need to be creative to find the keyword

Spoiler

We have the prefix, a 0 for keyword and the suffix

`hga43 0 368kd`

This is not an easy one to explain for keyword so I’ll go right to the point. 0 is glyph for all. Yep creative thinking !!!

`hga43all368kd`

We have the prefix, a 0 for keyword and the suffix

`hga43 0 368kd`

This is not an easy one to explain for keyword so I’ll go right to the point. 0 is glyph for all. Yep creative thinking !!!

`hga43all368kd`

Code #2
Observations
30 characters, a mix of letters and number without any specific range. Lots of repeats.

[hint]Check the solves from yesterday[/hint]

Spoiler

A string like this usually indicates that the first step is morse.

`.--- .--. .--. -.-- .--. .-.. ..--- ..... --.- -..- -..- ...-- ..-. -.-- -.-- ..--- ..-. .--. ...- ..- -.-- ...-- .--- ..- -.-. -.-- ..-. ..- -..- --`

We have 120 characters. Two options, groups of 6 for braille or groups of 8 for binary. Binary is easier to spot, let’s try it

`.---.--. .--.-.-- .--..-.. ..---... ..--.--. .--..-.. .--..-.- .---.--. .---..-. .--....- ..--.--. ..--.--- ..--.-.- .--..-.. .--..---`

Notice how every first bit is a dot? Dots=0 Dashes=1

`01110110 01101011 01100100 00111000 00110110 01100100 01100101 01110110 01110010 01100001 00110110 00110111 00110101 01100100 01100111`

Convert binary to Ascii

`vkd86devra675dg`

A string like this usually indicates that the first step is morse.

`.--- .--. .--. -.-- .--. .-.. ..--- ..... --.- -..- -..- ...-- ..-. -.-- -.-- ..--- ..-. .--. ...- ..- -.-- ...-- .--- ..- -.-. -.-- ..-. ..- -..- --`

We have 120 characters. Two options, groups of 6 for braille or groups of 8 for binary. Binary is easier to spot, let’s try it

`.---.--. .--.-.-- .--..-.. ..---... ..--.--. .--..-.. .--..-.- .---.--. .---..-. .--....- ..--.--. ..--.--- ..--.-.- .--..-.. .--..---`

Notice how every first bit is a dot? Dots=0 Dashes=1

`01110110 01101011 01100100 00111000 00110110 01100100 01100101 01110110 01110010 01100001 00110110 00110111 00110101 01100100 01100111`

Convert binary to Ascii

`vkd86devra675dg`

Code #3
Observations
All symbols separated by dots.

[hint]How do you usually convert symbols then think why they are repeating.[/hint]

Spoiler

Symbols usually convert to numbers, &=7, ^=6… then gives a decimal to Ascii sequence but in this case the symbols are repeating between 1 to 3 times. Your keyboard has 3 rows right ?

So &&& is the 7th character of the 3rd row which is m. Keep converting the rest of the string to get

`&&&.^^^.&.%.^^.%.@.%.^^.#.*.@@.*.&&&.&`

`m n u t h tw t h e i s i m u`

We now have the prefix and suffix

`mnuthtw theisimu`

or

`mnu32 386mu`

The ciphers used symbols which is a valid keyword.

`mnu32symbols386mu`

Symbols usually convert to numbers, &=7, ^=6… then gives a decimal to Ascii sequence but in this case the symbols are repeating between 1 to 3 times. Your keyboard has 3 rows right ?

So &&& is the 7th character of the 3rd row which is m. Keep converting the rest of the string to get

`&&&.^^^.&.%.^^.%.@.%.^^.#.*.@@.*.&&&.&`

`m n u t h tw t h e i s i m u`

We now have the prefix and suffix

`mnuthtw theisimu`

or

`mnu32 386mu`

The ciphers used symbols which is a valid keyword.

`mnu32symbols386mu`

Related