On the Subject of Core Encryption
Core Encryption more like Shifting Shifting Shifting Shifting Maze
Solving the maze
- Write down the 4 flashing numbers in order starting from anywhere.
- Calculate 5 numbers where nth number is the sum of all digits on nth position.
- Modulo all of them by 8 and Add 1 to the first 4 numbers.
- First 2 numbers: starting row and column. 3rd and 4th numbers: goal row and column (top-left is 1,1).
- 5th number: odd -> left maze, even -> right maze.
Red cells are walls. Navigating into a wall will strike and show the current coordinate. Upon reaching the goal an indicator will start flashing.
Decoding the numbers
Reorder the 4 initial numbers (called Ni below) starting from the one which flashes alongside the indicator. Calculate 4 shifts (Di means ith digit). If any shift ends up less than 10000 add 10000.
- S1 = floor((N1 ^ 2 + product of N1 digits) % 88889)
- S2 = floor(((D1 of N1) + (D2 of N2) - (D3 of N3) + (D4 of N4) + 10) % 88889)
- S3 = floor(((N3 * N1) / (N2 * N4) + 9999) % 88889)
- S4 = floor((((D3 of N3) * N4) / (N2 - (D3 of N1)) + 11111) % 88889)
Calculate the following:
- End numbers: Ei = Ni + Si
- (E1 - E2 + E3 - E4 + 1000000) % 44445. Modulo each digit by 5 and submit.