Originally Posted by
Fire Cape
Some of you know I have been gone a long time and I must finally confess that after hours I have been in the library investigating ways that we can gain access to old maps. I dug up all the research on the topic already and originally came to the conclusion that it was impossible, but thanks to private messages with Lmctruck I have now discovered once and for all how to decrypt XTEA.
XTEA (extended tiny encryption algorithm) is a block cipher designed to correct weakness in the original tiny encryption algorithm (spelt TEA like the drink) obviously with a name like that it was designed by professors at Cambridge.
The algorithmic complexity of bruteforcing the keys was considered to be too exhaustive, but thanks to my extensive research into the subject I can without further ado present the ultimate method for decryption of all your map datas.
Code:
void decipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4]) {
unsigned int i;
uint32_t v0=v[0], v1=v[1], delta=0x9E3779B9, sum=delta*num_rounds;
for (i=0; i < num_rounds; i++) {
v1 -= (((v0 << 4) ^ (v0 >> 5)) + v0) ^ (sum + key[(sum>>11) & 3]);
sum -= delta;
v0 -= (((v1 << 4) ^ (v1 >> 5)) + v1) ^ (sum + key[sum & 3]);
printf("i found a key thanks lmctruck \n");
}
v[0]=v0; v[1]=v1;
}
To download all of the rs maps I have deciphered see my video here
Code:
https://www.youtube.com/watch?v=dQw4w9WgXcQ
Remember to like and thank or I will add anti leech
Edit: Added new revs
Code:
|(1:parangaracatirimicuaro)|leaf
tree:|
| | | |(5:ngaracatirimicuaro)|leaf
| | |(4:a)|
| | | |(10:catirimicuaro)|leaf
| |(3:r)|
| | |(22:o)|leaf
|(2:a)|
| |(5:ngaracatirimicuaro)|leaf
| |
| |(10:catirimicuaro)|leaf
| |
| |(12:tirimicuaro)|leaf
|
| | |(5:ngaracatirimicuaro)|leaf
| |(4:a)|
| | |(10:catirimicuaro)|leaf
|(3:r)|
| |(15:imicuaro)|leaf
| |
| |(22:o)|leaf
|
|(5:ngaracatirimicuaro)|leaf
|
|(6:garacatirimicuaro)|leaf
|
| |(11:atirimicuaro)|leaf
|(10:c)|
| |(19:uaro)|leaf
|
|(12:tirimicuaro)|leaf
|
| |(14:rimicuaro)|leaf
|(13:i)|
| |(16:micuaro)|leaf
| |
| |(18:cuaro)|leaf
|
|(16:micuaro)|leaf
|
|(19:uaro)|leaf
|
|(22:o)|le
RandomMiddle
Input. A permutation π ∈ SV
Output. A π-routing ρπ : u 7→ ρπ (u) ∈ Pu,π(u)
1. For each u ∈ Z
d
2
do (in parallel)
a. select randomly a node α(u) ;
b. as in BitFixingStrategy choose a path L0 from u to α(u) ;
c. as in BitFixingStrategy choose a path L1 from α(u) to π(u) ;
d. let us take the concatenation ρπ (u) := L0 ∗L1 ;
2. Output ρπ
Ehd = {{(x, j),(x, j +1)}| j ∈ [[0,n−1]],x ∈ Z
d
2
} : horizontal edges
Ecd = {{(x, j),(y, j +1)}| j ∈ [[0,n−1]],x ∈ Z
d
2
,y = x+ej} : crossing edg