What I like about cryptography is most of the time it can be really easy to understand how it works, but WHY it works, now that is some black magic shit. You can have a first year student implement this function, but everything about the algorithm, from the magic seeding state number to every binary operation is wild.
Thank you a lot! As you demonstrated the MD5 hash algorithm, it seems possible to reverse it and retrieve the original input. I thought hash functions were meant to be one-way and irreversible. Could you please clarify this?
@@rareskills_io Thanks for the response I know we append original length but what if the original length of the message exceeds to more than 18446744073709551615 I mean 😂😂 more than 64 bits and another question this length is in bits or bytes if we talk about its unit
I stared at the course slide for 2 hours couldn't figure it out. And you helped me understand it within 10 minutes XD. This video deserve more views.
Glad it saved you time!
The video i needed. Thank you so much
very clear and clean explanation, thank you !
You're welcome!
Thanks for making a hard topic into the easiest❤
You're welcome!
Thanks man, you are really good at teaching
Happy to help!
Thanks Jeff , big fan of you and RareSkills.
Appreciate it!
Hello, great video! What to do when I have a input of for example 10kb? How do I hash that?
Very well explained. Thanks a lot!
Thank you for watching!
Thanks, which operation makes it impossible to revert ? How do we prove that ?
Every single step is a boolean operation, none of those can revert (like popping an empty array or dividing by zero can).
@6:32 error in dialog or graphic: dialog states "C prime = A" but graphic shows "C prime = B".
Nice content!!
@6:54 after first iteration, B prime has only 7 hex digits instead of 8 (0xE872CE5).
The leading 0 isn't shown.
What I like about cryptography is most of the time it can be really easy to understand how it works, but WHY it works, now that is some black magic shit.
You can have a first year student implement this function, but everything about the algorithm, from the magic seeding state number to every binary operation is wild.
Like just learn algebra
Amazing!!
i'm a bit confused where in the process bitwise OR, AND, XOR and NOT come into play. Otherwise great and easy to understand.
keep the good job
Thank you! More to come.
Thank you a lot! As you demonstrated the MD5 hash algorithm, it seems possible to reverse it and retrieve the original input. I thought hash functions were meant to be one-way and irreversible. Could you please clarify this?
Reversing isn't the attack to worry about. It's that two messages can hash to the same result, allowing an attacker to forge messages.
Thank you
You're welcome!
Bro I have a question please help me soon, "My question is what if the size of the message becomes larger than 64 bits or exactly 64bits "
The input is always padded to a multiple of 512 bits + 448 bits, then the original length is appended.
@@rareskills_io Thanks for the response I know we append original length but what if the original length of the message exceeds to more than 18446744073709551615 I mean 😂😂 more than 64 bits and another question this length is in bits or bytes if we talk about its unit
@@syedbilalalam4446 only the least significant 64 bits will be used in that case.
After watching this I somehow feel MD5 is the stupidest hashing algo of all time
Why
@5:54
Thank
University? Nah. TH-cam? Yeah.