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.
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.
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.
Thank you for the nice explanation :)
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.
how does a reduction function work?
From what I learned online, it's a function that turn a hash into an ASCII.
This was helpful for me
Thank u so much! - clear and brief explanation👍
But why does he have to hash so many times?
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.
dont rainbow tables use different reduction functions?
Dankeeeeee
Danke