Reverse Engineering for Beginners

CHAPTER 79. “QR9”: RUBIK’S CUBE INSPIRED AMATEUR CRYPTO-ALGORITHM CHAPTER 79. “QR9”: RUBIK’S CUBE INSPIRED AMATEUR CRYPTO-ALGORITHM

for (x=0; x<8; x++)

for (y=0; y<8; y++)

tmp[x][y]=get_bit (x, y, row);

for (x=0; x<8; x++)
for (y=0; y<8; y++)
set_bit (y, 7-x, row, tmp[x][y]);
};

void rotate_t (int row)
{
bool tmp[8][8];
int y, z;

for (y=0; y<8; y++)

for (z=0; z<8; z++)

tmp[y][z]=get_bit (row, y, z);

for (y=0; y<8; y++)
for (z=0; z<8; z++)
set_bit (row, z, 7-y, tmp[y][z]);
};

void rotate_l (int row)
{
bool tmp[8][8];
int x, z;

for (x=0; x<8; x++)

for (z=0; z<8; z++)

tmp[x][z]=get_bit (x, row, z);

for (x=0; x<8; x++)
for (z=0; z<8; z++)
set_bit (7-z, row, x, tmp[x][z]);
};

void rotate_all (char pwd, int v)
{
char p=pwd;

while (*p)

{

char c=*p;

int q;

c=tolower (c);

if (c>='a' && c<='z')

{

q=c-'a';

if (q>24)

q-=24;

int quotient=q/3;

int remainder=q % 3;

switch (remainder)

{

case 0: for (int i=0; i<v; i++) rotate_f (quotient); break;

case 1: for (int i=0; i<v; i++) rotate_t (quotient); break;

case 2: for (int i=0; i<v; i++) rotate_l (quotient); break;

};

};

p++;
};
};