Assembly Language for Beginners

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

Here is the whole source code reconstructed:

#include <windows.h>

#include <stdio.h>
#include <assert.h>

#define IS_SET(flag, bit) ((flag) & (bit))
#define SET_BIT(var, bit) ((var) |= (bit))
#define REMOVE_BIT(var, bit) ((var) &= ~(bit))

static BYTE cube[8][8];

void set_bit (int x, int y, int z, bool bit)
{
if (bit)
SET_BIT (cube[x][y], 1<<z);
else
REMOVE_BIT (cube[x][y], 1<<z);
};

bool get_bit (int x, int y, int z)
{
if ((cube[x][y]>>z)&1==1)
return true;
return false;
};

void rotate_f (int row)
{
bool tmp[8][8];
int x, y;

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]);
};