The best way to explain rainbow tables is to compare this kind of attack to the brute force and the
trend of attacks.
When an attacker brute force is a password he has to generate a hash for every attempt or for every
possible password combination he has.
Then he compares the resulting hash through the hash in the table he wants to crack.
If he gets a match then he knows a password so to speed things up.
What if this attacker saves his brute force work by creating a table for all the password and hashes
he was generating next time.
He only compares two hashes so this will save the computation time to convert an alphanumeric password
to a hash and then compare this hash to the hash in the table.
He wants to crack this will significantly speed up the cracking process.
However the table would have to be huge to have every possible password.
So as you see a rainbow table is a file of the computed password hashes rainbow cracking is proven to
be more effective and less time consuming than brute force and dictionary attacks.
So it uses less computer processing time but more storage.
So before we can begin to crack caches using rainbow tables we need to generate these stream tables
we can generate them using the tool R D Gen.
Here you can provide the hashing algorithm whether it's empty five and four shuttle five six etc. and
then you'll cut up the set that can be alphanumeric lower Alpha.
It can be numeric etc. and these two arguments are the size of the password the length of the basalt
minimum and maximum.
Then we have these parameters here which are related to be honest to advance cryptographic stuff and
we will not go deep into that now I'll give you just general guideline on that.
The table index is actually the reduction function.
We will have this rainbow tables generated.
Meanwhile the chain link is simply the length of the chain you want to generate and the chain number.
As you can see that rainbow table is actually an array of frame both chains.
So here you specify the numbers of the chains you want to have in the same table and the part index
is actually to store the large rainbow table in smaller chunks.
So don't worry about this.
Just focus on the first two or first couple of arguments.
So let's start by creating rainbow tables here for the empty 5 algorithm.
Will use numeric as my character set and the minimum length is 1 and the maximum length is 8 and I will
use these default values like zero thousand thousand and see now that generated this rainbow table.
If you go to list you will able to see actually not.
Here we need to go to Rainbow.
Crack cocaine will crack.
And actually this is directed here.
So let's go to this directly and we will be able to see the rainbow table file generated here.
This is the end with it.
Next we need to sort this out.
We will invoke the comment R to sort and just provide the path just by using dots after we have generated
the rainbow table and sorted it.
Now it's time to crack a hash using this method.
So we will use the command.
Correct.
You can see here the syntax which is very easy.
Just strike our crack then use dot to refer to the rainbow tables found in the current directly.
Then provide the H argument and provide a hash for this purpose.
We will go here to an online and the five hash generated and just select and is string like this one
just copy the hash here then paste it and hit enter.
It's very fast as you see and the results are here.
This hash corresponds to this password.