REQUIREMENTS
--------------
Brain
Math Knowlegde
Programming Knowledge(NOT BATCH/DOS)


Okay, if you've read my other article, then you will know how the algorithm works, if not, then here is the explanation, word for word from my other article:


CODE :



Understand that much? Good. Now we can begin. The aim of this mission is to crack the hash. Since this is my own algorithm, something like Cain and Abel can not be used. Rather, you must program YOUR OWN bruteforcer. Now this bruteforcer will not use a dictionary attack... ( I imagine you could crack it with a dictionary attack, but that's not the focus of this article, and there is a much simpler way)... the method I will show you is bruteforcer with math.
First, I'll tell you a secret. The hash supplied in the mission is not good to start with. It has something special about it, that will be explained later, and this could halt you where you would progress with another hash. Instead, I will show you how to add a debug line into the batch file that will generate new hashes to test.

After the END label add a line to echo the hash out to a file.
E.g.


CODE :


This would output the hash to a file on your desktop called hash.txt. For this mission, we will use a simple hash. Lets say, the word WIN. Type win into the program and let it output the hash. You should get: 82087 If you did, then proceed to the next step.

Okay, now let's start writing our program. To come up with a concept of how to go about this process, think about it logically. How would you go about cracking the hash BY HAND. Well the idea is that only those 3 primes will go into and nothing else. So get all the primes 2-101 and go down the list. Is 82087 divisible by 2? No.. 3? No. 5? No.. and so on until you find a number that is divisible. Once you find one you know it is one of the letters in the word. Now to find the other two, we need to take that one out, to do so we just divide the hash by the number we found. E.g.

Lets say we use the hash 8. This is the hash for aaa

Is it divisible by 2? Yes
Write down a two.
So now divide the hash by two.
We now have 4 as our hash, which is the hash of aa.
Is it divisible by 2? Yes
Write down a two.
So now divide the hash by two again.
We now have 2 as our hash, which is the hash of a.
Is it divisible by 2? Yes
Write down a two.
So now divide the hash by two.
We now have 2 as our hash, which means that we have cracked the hash.
The end result was the numbers 2, 2, and 2.
Converted: aaa


So use loops and math to go about automating this. To check if a number divisible, just check the quotient for a decimal. E.g.

8/3=2.67 (Has a decimal, thus not divisible by three)
8/2=4 (No decimal means its a whole number and that two is divisible)


Once you have a program that can crack the hash:82087, you need to add one more thing. Integer Overflow. This one is tricky at first, but simple once you get it. I'm going to introduce you to a word here. Modulo. Now I will explain it.

8 wrapped by a modulo of 5 would be 3.
26 wrapped by a modulo of 5 would be 1.

Make sense? No? Let's go further. 8/5=1.6 It goes into 8 only one full time. The remainder is the final output. 26/5=5.2 It only goes into 26 five full times, thus one, being the remainder is our answer. So how does this apply to our hash? Well for the hash of "win" it doesn't. But for the hash in the algorithm, it makes ALL the difference. In programming, sometimes a number will exceed a maximum limit. In that event, the number will wrap by a modulo of that limit. Put simply, if the limit were 5 and the input 26, we know that 26 would become 1. However, we are dealing with much bigger numbers. In this case the limit is * to the ** power (I'll let you figure that one out on your own :P) So we need to keep unwrapping the hash each time the program fails to crack it after a certain number of loops. Once the program loops so many times, obviously the hash is wrapped and can never be solved. So have your program detect this, and add the limit number (modulo) one time and run the loop again. Keep doing this until you get a hash. It's that simple. I don't want to spoil this part of the mission, so I'll just say if you need help on it, contact me on HTS and I'll help you out a little. (Just ask Chiodium ;] )