RSA 2012 #sophospuzzle challenge

I admit, I didn’t take this one on; I’m just not much of a coder. I did, however, find it extremely interesting, especially in the way the original puzzle was “encoded.” You can see the original puzzle and challenge here. It’s actually a concatenated C routine:

#include~!int~putchar(int~c);char~*m="noncen.cmh/alu/puyxs.hrhb\xd\xa";void~main(int~argc,char~**argv){if(argc>1&&strlen(argv[1])==8){int~i=0;while(*m){putchar(*m+(*m<0x41?0:argv[1][(++i>8?i=1:i)-1]-0x61));m++;};};}

Sophos promises more puzzles in the future on their nakedsecurity blog.

I’ll be watching, for sure, and stay tuned: tomorrow’s post will show the solution.