Ganoes Paran's Ganoes - First Crackme
| Download Ganoes_-_First_Crackme.zip, 184 kb (password: crackmes.de) Browse contents of Ganoes_-_First_Crackme.zip Hiya! Ganoes here. and this is my first crackme.
Difficulty: 2 - Needs a little brain (or luck) | RatingWaiting for at least 3 votes View profile of Ganoes Paran » |
Solutions
Solution by fireblast, published 12. jun, 2009; download (4 kb), password: crackmes.de or browse.
fireblast has not rated this crackme yet.
Discussion and comments
| freesoul 05. Jun 2009 | solved but a little bug found, when you add the sums you do one addition out of memory I think you do something like for(i=0;i<strlen(name);i++) hashes[i+1] += hashes[i]; you have to do something like for(i=0;i<(strlen(name)-1);i++) hashes[i+1] += hashes[i]; |
|---|---|
| Ganoes Paran Author 05. Jun 2009 | yea, was a tad buggy i think, i dunno, was my first crackme afterall :P this was, more or less,a little test run to see if i can make a stable crackme. over the past few days i made another one, significantly harder then this. you ight be interested in trying it out =) |
| fireblast 08. Jun 2009 | Good little crackme :) . freesoul, from the assembly, it looks more like : for (i = 1; i < strlen(name); i++) serial[i] += serial[i-1]; Anyway, you ought to put some more bound checking. Anyway, theere seem to be a buffer overflow which only affects the password (if you input a huge username, you overwrite the password memory and bypass the password entry). I might be wrong but it is how I see it ;) . |
| Ganoes Paran Author 08. Jun 2009 | Yes this is true. I only used a standard array to hold 256 members, you break and it'll go past. but then again, i wasn't expecting someone to have a name that big :P |
You may leave your comment, thoughts and discuss this crackme with other reversers here.
Acting childish will not be tolerated.
HTML and such will be left as-is, so don't try.