The algorithm is symmetric because i could decrypt back every character and key combination.
These two functions were tested by a loop for any error in decrypting the value back:
#include <iostream>
using namespace std;
unsigned char enc(unsigned char ch, unsigned char key)
{
unsigned char tmp = key^(~ch+(unsigned char)0x04);
return (( (tmp<<3) | (tmp>>5) ) & 0xff)-0x02;
}
unsigned char dec(unsigned char ch, unsigned char key)
{
unsigned char tmp = (ch+0x02);
tmp = ((tmp>>3) | (tmp<<5)) & 0xff;
return ~((tmp^key )-(unsigned char)0x04);
}
int main()
{
// single encryption test
char c = 'A';
char key = 'K';
cout << "single test:" << (char)enc(c, key) << endl;
bool problem = false;
int k, ch;
for(k=0;k<256;k++)
{
for(ch=0;ch<256;ch++)
{
if( enc( dec((unsigned char)ch, (unsigned char)k), k) != ch )
{
problem = true;
cout << "error k=" << k << "c=" << ch
<< "result=" << (unsigned int)enc( dec((unsigned char)ch, (unsigned char)key), (unsigned char)key) << endl;
}
}
}
if(problem) cout << "There was a problem." << endl;
else cout << "There was no problem." << endl;
}