| Excellent crackme, as usual! |
==> |
| It's been a while since I've had time to do a crackme. I finally got a little time, and chose yours at random from the front page. I just wanted to say thanks, because it was perfect for me! Easy enough to do pretty quickly, and not boring. I love these VM-style challenges. |
==> |
| Thanks @pinnn! I read yours, and it's the third time recently I've had someone talk about pintool. I think I need to learn about it (and dynamorio)! |
==> |
| Thanks @ttlhacker! I'm also looking forward to reading your solution @pinnn... I would love to know the best way to crack this. |
==> |
| Another brilliant crackme, ttlhacker! Thank you for all the thought/work you put into making these. I always learn something new working them out. If I can think of a reasonable way to write up a solution, I will, but it's going to take some thought.
SHA1(password) = aa4cc69f4eaf8a6d0e5a82be47c20f9612850882 |
==> |
| @x0r19x91: I think the non-uniqueness adds to the fun, even if you consider it a bug --- it makes you have to think a little more about how to come up with a solution, since there are choices to be made #4x10m_0f_ch01c3. But yes, I'm aware my solution wasn't the intended one. I'm assuming the one you had in mind satisfies
SHA1(password) = c2008e29ab0ea2383a1afb5010309d4097f8f7c3 ? |
==> |
| Cute little math problem! Thanks!
SHA1(password) = 7c9072c5d04b607523834d174e51366cc65cd666 |
==> |
| Finally got around to doing this one. Ingenious crackme! Intimidating at first, but not too bad if you think about it in the right way. Thank you! |
==> |
| @s4r, just read your awesome write up! It does a great job of explaining things, especially your game 2 summary. Also, I was really surprised how you dealt with the encrypt_string; that was a really clever observation. Thanks for the solution! |
==> |
| @s4r: I'm glad you're enjoying it! There is at least one printable password, but I can't guarantee there aren't other solutions (printable or otherwise). If you find something that works, it counts as a solution, printable or not. If you do come across a non-printable solution, I'd love to know about it! Also, I did try to put enough checks in the code to avoid things like segfaults, but if you hit an error, please let me know what input caused that, too. I downloaded your bitflip machine a couple of days ago, and I hope I have time to start looking at it soon. Looks like another interesting crackme.... I love this site. |
==> |
| @ttlhacker I'll definitely write up a solution at some point, but this one was complicated enough that it'll take some thinking about the best way to do that. I don't want to say too much in a comment because I don't want to spoil it for anyone else. I ended up writing a program to just "compile" (if that's even the right word) the whole thing at once, then statically analyzed the result. Of course, this meant I had to learn how to compile it in the first place, which was by far the most challenging part for me. And naturally I outsmarted myself: I had my compiler simply ignore all the blocks that weren't valid code, which meant that one kind of really super important block was totally missing without my realizing it. It took me a long time to figure that one out. Thanks again for this! I've never written a crackme before, but there have been a few on this site that have made me want to try to write one; this is one of them. |
==> |
| This was incredible! Each time I thought I was on the last layer of things I needed to figure out, there was another layer waiting for me. You are a mad scientist ttlhacker!
sha256(flag) = 638da17366d6d99d7a60568a8eba64a71217743f602d9ca2cb961f063bb093b6 |
==> |
| Thanks, ttlhacker! This has been one of my favorites so far! |
==> |