This is the best description of 2nd preimage resistance I've found. Helps a visual learner like me greatly. I found the text in WIlliam Stallings & Lawrie Brown's book not so easy to understand.
Well done, Adam! This is, hands down, the most straightforward and understandable explanation of these topics I've ever encountered. Thank you so much for sharing your insights here!! 😁👍
Nice video. Just to add, collision resistance is more useful when using hashing for hash tables, and look up purposes. In this case, lack of col. resistance can result in poor performance.
Absolutely important for other areas of computing - 100%! But also important in security - if my facebook password - dog - and your password - cat - both hash to the same hash, then probabilistically the set of possible hashes is reduced, and the security is also reduced.
In the first case (second preimage resistance), the attacker is handed a fixed m1 to which he has to find a different m2 with equal hash. In particular, he can't choose m1. In the second case (collision resistance), the attacker can freely choose both messages m1 and m2, with the only requirement that they are different (and hash to the same value).
Buttermilk is right - but essentially.... 2nd preimage one of the inputs is fixed, but for collision resistance both of the inputs can be varied. 2nd preimage is finding a fake version of the newspaper that has the same hash as the legitimate newspaper (harder to do - and more lucrative if you can pull it off). Collision resistance is creating two random newspapers and continuing to randomly generate newspapers until any two that have the same hash (will occur more often following the birthday paradox)
This is the best description of 2nd preimage resistance I've found. Helps a visual learner like me greatly. I found the text in WIlliam Stallings & Lawrie Brown's book not so easy to understand.
This is the best explanation I'd seen yet. Thanks a lot!
It is so easy to understand hash-function and attacks, thanks for your hard working.Adam
Best explanation I've seen on youtube. Good stuff mate
Concise and articulate. The most simple and efficient explanation of second preimage resistance floating around. Keep up the good work.
I have my information security exam tomorrow and this is THE BEST video on hashes! thanks Adam you are a legend!
you explained second preimage resistance better than any explanation ive read/seen in 3 minutes, thank you so much!
Well done, Adam! This is, hands down, the most straightforward and understandable explanation of these topics I've ever encountered. Thank you so much for sharing your insights here!! 😁👍
Great video
Thank you Adam, that one was great!
Adam IS the Best! So much clearer than my college professors!
Thanks for the great explanation, Adam! :D
thank U
you are the BEST ..
this was very helpful thank you so much
not all heroes wear capes
I liked it really!
life saver!
Amazing vid, great job. Thanks
Love this video, thanks Adam! :)
hats off, Adam! could not have been better!
Great work. thanks
@Adam
Nice video. Just to add, collision resistance is more useful when using hashing for hash tables, and look up purposes. In this case, lack of col. resistance can result in poor performance.
Absolutely important for other areas of computing - 100%! But also important in security - if my facebook password - dog - and your password - cat - both hash to the same hash, then probabilistically the set of possible hashes is reduced, and the security is also reduced.
agreed, thanks
Thank you for the video! Learned alot!
Very good, thanks!
very nice explanation really informative
well explained thx a lot
What is difference between 2nd preimage attack and CR attack?
In the first case (second preimage resistance), the attacker is handed a fixed m1 to which he has to find a different m2 with equal hash. In particular, he can't choose m1.
In the second case (collision resistance), the attacker can freely choose both messages m1 and m2, with the only requirement that they are different (and hash to the same value).
Buttermilk is right - but essentially.... 2nd preimage one of the inputs is fixed, but for collision resistance both of the inputs can be varied.
2nd preimage is finding a fake version of the newspaper that has the same hash as the legitimate newspaper (harder to do - and more lucrative if you can pull it off). Collision resistance is creating two random newspapers and continuing to randomly generate newspapers until any two that have the same hash (will occur more often following the birthday paradox)
Wont the hashes be encrypted to perform collision?
did not pause the video
but nice vid
"Fake News" LOLOLOL