Hashing - what it is, how it's used and why it matters - with MD5 and SHA2-256 examples
Vložit
- čas přidán 15. 07. 2022
- This video steps through how hashing works , what it's used for and why it's really important as a supporting process for many other areas of tech. It also explains a critical MD5 vulnerability vs something more secure like SHA2-256.
▶ marc-stevens.nl/research/pape...
▶ natmchugh.blogspot.com/2015/0...
▶ www.sentinelone.com/cybersecu...
▶ Check out my full range of content at learn.cantrill.io
▶ Join the best online technical study community techstudyslack.com
FOLLOW ME 😺
▶ Twitter: / adriancantrill
▶ CZcams: / learncantrill
OTHER VIDEOS AND PLAYLISTS 🎞
▶ Network Fundamentals • Networking Fundamentals
▶ Technical Fundamentals • Technical Fundamentals
▶ AWS Fundamentals • AWS Fundamentals
▶ Course Intros • learn.cantrill.io - Co...
▶ Exam Question Practice • AWS Exam Question Walk...
▶ MINI PROJECT - Hybrid DNS • Mini Project - Hybrid ...
▶ MINI PROJECT - Advanced VPN • Mini-project - Advance...
▶ MINI PROJECT - Pet Cuddle O Tron • Mini-project - Pet-Cud...
▶ MINI PROJECT - Web Identity Federation • Mini-project - Simple ...
▶ MINI PROJECT - Architecture Evolution • Mini-project - Applica...
▶ MINI PROJECT - Cat Pipeline • Mini Project - CatPipe...
▶ Best Videos • Best Videos
All rights reserved © 2022 Adrian Cantrill - Věda a technologie
You've done a great job explaining unexplainable! Thanks. Very thorough step by step tutorial based on examples for non-tech human beings.
thanks for the comment, glad you're enjoying the videos.
I understood,, it was simple and straight forward ,, Thank you so much
great work, great knowledge and great teaching
Glad you liked it!
The hashing of passwords example seems a bit odd to me.
It says that the client will hash the password and send the hash to the server. That seems like a bad practice. If an attacked gains access to the hashes of the server, they can just act as the users by sending the hashes that they gained access to, to the server.
The better way would be for the client to send the password to the server (encrypted, over https or similar) and for the server to hash the password and then compare that to the stored hash. That way, the attacker won't gain access to anything if they gain access to the hashes (unless they bruteforce them). If the client sends the has to the server, the attacker is free to use the hashes to impersonate the user. When sending the hash from the client to the server, you have basically "gone full circle" and would have the exact same problem as you have when you store passwords as clear text in a database.
Great video though. Love it! :) Many thanks. Deserves waaay more views.
Imagine my surprise when I noticed your PowerLevel10k shell prompt - complete with emoji.
Is there any other way ?
Hi,what caused the collision?
it was artificially generated, check the links attached to the video for details about how this is done. The issue is that it shouldn't be possible with a hashing algo which is working correctly.
@@LearnCantrill yh,I will check the resources you added, please upload more videos like this. algorithms and data structures and diffrent methods of data processing very informative, thank u
How does the unhashing work on system?
you cannot 'unhash'
@@LearnCantrill thanks for the reply, understood, basically the actual data is never compared it is the hash value which is stored and compared.
@@gauravgoel2597 When you need to compare a value to a hash, the server has to first hash the value, using the same method as the has that it will be compared to was hashed.
For a login:
* user sends a password to the server
* the server hashes that password and gets Hash A
* the server loads the password hash for the user from the database; Hash B
* If Hash A exactly matches Hash B, the user is authenticated
And not password needed to be stored in the database, just a hash of the database. The password hashing example in the video is unfortunately a bit misleading.
Like No. 256 :-p which could be written as # (hash) 256 lol
total number of data is a, total number of hash values is b, what if a>b. then two pieces of data could have the same hash???