didn't understand a word of it, but it demonstrated that most sites are getting confused between simple two column hash / password lookup tables and rainbow tables.
The explanation is great but, the chain that is saved is the first plain text (p1) and the last hash of the chain (Hn). Not the first plaint text (p1) and the last plain text in the chain (pn), as you have shown in the video.
its a math function that takes a hash and turn it to a password value - like for exemple : hash : jk2j3kkdaslkj3k12ldksaldksal if we apply a reduce function to it , it will generate a string like a password R(jk2j3kkdaslkj3k12ldksaldksal ) = password123 so u give it a hash and it will gives u a string that looks like a password
so far this is the only video that could explain it somewhat to me but I haven't totally udnerstood the end and how it goes from right to left using the same process that went from left to right ?
TL;DR - a rainbow table is an indexed database of computed hash values. So if you have the hash of a password, you can quickly look it up VS brute forcing it.
didn't understand a word of it, but it demonstrated that most sites are getting confused between simple two column hash / password lookup tables and rainbow tables.
after 3 hours finally i understand it from u ! THANKS A LOT
The explanation is great but, the chain that is saved is the first plain text (p1) and the last hash of the chain (Hn). Not the first plaint text (p1) and the last plain text in the chain (pn), as you have shown in the video.
how does a reduction function work?
From what I learned online, it's a function that turn a hash into an ASCII.
its a math function that takes a hash and turn it to a password value - like
for exemple :
hash : jk2j3kkdaslkj3k12ldksaldksal
if we apply a reduce function to it , it will generate a string like a password R(jk2j3kkdaslkj3k12ldksaldksal ) = password123
so u give it a hash and it will gives u a string that looks like a password
What is the goal of the reduction function? To make the rainbow table more space effecient? Please correct me if I am wrong...@@zedhacking
so far this is the only video that could explain it somewhat to me but I haven't totally udnerstood the end and how it goes from right to left using the same process that went from left to right ?
It doesn't. If you hit P4, then you start from P1 (the table has the pair P1-P4) and keep hasing/reducing until you get to the password.
But why does he have to hash so many times?
dont rainbow tables use different reduction functions?
Thank you for the nice explanation :)
TL;DR - a rainbow table is an indexed database of computed hash values. So if you have the hash of a password, you can quickly look it up VS brute forcing it.
Thank u so much! - clear and brief explanation👍
This was helpful for me
Dankeeeeee
Danke