Hashing: Why & How?
Вставка
- Опубліковано 2 жов 2024
- Why do we wish to reduce a long list to a short one? How to do it, so that the short list will identify the long list. How to do it so that it is impossible to identify the long list from the short one, and the implications of the fact that many long lists share the very same short list. Hashing configurations: straight encryption, MD4, MD5, SHA-1, SHA-2.
I liked the way you explained the points from least important to most important. I also enjoyed my time here. Definitely, I will look for more videos in this channel.
I am by no means (very) technical, but this is the first time I see such a clear explanation. So thank you so much!
+Walter Bril Thank you Walter: Explaining technical stuff to non experts in the field is very important on many levels, and is missing everywhere. I am glad I can help in that regard.
You simplified hashing into a sentence...thank you for this clear explanation...
I was searching for hash and somehow ended up here.
excellent explanation...almost give up trying to find out how it work on a simple way.
I am not a technician or engineer, however, I found the explanation very fascinating. I may have to go back a few steps though. Thank you :-)
+Dj Mr Cool -- you are most welcome. I try to build my explanation on common sense not on uncommon knowledge.
Hi Gideon Samid,
it's really good and clear explanation .. i can say it's very basic flow .. fantastic job ... i am looking how HASH JOINS functionally and its behaviour work..
i gone through Google but no luck ...
Looking your assistance.
Regards
Moses
Subscribed after the first 2 minutes because of the clarity of explanation I found in this video (and later in the rest of your videos). Thank you professor! I found awesome study material on your website too.
+sladkacokoladka Thank you much (although I cannot decipher your name). Keeps me motivated!
u are the best professor.....i like ur method to explain the problems....thank you very much professor
First video I've seen of yours and I subscribed within the first minutes. Very clear explanation, thank you!
Thanks Beata, it feels good to be useful!
I love this video thank you so much!!
13:55 Why do we use blocks instead of every character its own block or have one long string hashed itself many times?
Efficiency
I like the way u initiated your presentation.It is an experience.
Thank you sir
+salahe amean -- thank you! Glad it was useful for you!
Wonderful explanation shalom to you
+Education Made Easy -- thank you, and Shalom!
Great point that collisions are unavoidable (and can only be made more difficult to find) given that we are taking an input of size S and trying to represent it in a smaller size L.
Thanks for the video.
I have one comment about what you said on information theory, that a short list cannot contain all the information about the long list, just because it's shorter, that is not correct. For example, a compression algorithm can reduce the size of a big list into a smaller one without any loss of information, then a decompression algorithm can reproduce the original list again.
Question: does " implications of the fact that many long lists share the very same short list" mean that there are already collisions we don't even know about?
Thanks for the video. One question: A hash (like SHA-256) could be used to copyright? Like a song? If the SHA256 of the file (mp3) + date, this could be used in a certificate?
+Kfu Dub yes, it could, but you need a trusted party to carry out the hash.
Hi,nice explanation. Can you please name encryption protocols having cipher size greater then plain text size. 😊
very detailed explanation I hope if I can get more videos related to the cryptography topics
Thanks too much
I was going through hashing concepts, and this was a clear and crisp good explanation. Thank you
thanks for your kind words
Are Salts stored on the local machine? As there not stored in the database??
sorry Just clarifying the point of cypher is to condense the text so that if we have limited spots available we have less chance of multiple data parts sharing the same spot and therefore avoiding collision? Also I like the way this lecture is presented would you mind making a video on how the polynomial has function works?
+Rose B
Thank you Rose, if I find time, will upload the requested video.
awesome sir searched across google..found uh the best ....
Thank you sir for your beautiful explanation. Super.
I dont know what it is about your presentations but these help me understand so well. I especially appreciate how you build the foundation first and work from there. Great lecture
Thank you bestforgebuilder, I am really glad that you absorb it all so well!
Very nice Prof Gideon. Its very nice tutorial.
nice explanation sir!,,,u did well in this video,,and thanks
i need to see some lectures abut minhash and minhash types please
Thank you. Very informative
Thank you for the simplicity.
Lost me at l to the e. Poor delivery.
Thank you prof. ! Toda Raba! :-)
Awesome explanation Sir.
5:40 You're talking about the pigeonhole principle here, correct?
he ain't using pigeonhole principle here.. he's just applying the hash function to get a fixed size hash value of s bits, say for l bit block of data.
Loved your explanation
Thank you Sir!
Thanks a lot!! 👏👏👏👏
#Gideonsamid sir
very very good explanation . I salute you sir ji.
+nareshk kumar Thank you! My pleasure!
This sir looks like Walter white😂
lol - catch a few hi lights
Finally I get it!
Thank you!
Nice, short & effective
great explanation! thanks!
thank you sir! thanks a lots!
wtf is with the clicking...
This guy is great.
2 advanced 4 me
salami 2 u
How can we get a cryptocurrency backed by anything
check out bitmint.com, or the book "Tethered Money: Managing Digital Currency Transactions" available on Amazon (Elsevier 2015), including digital edition.
Much appreciated.
Excellent Explaination.......
Awesome
thank you
bitcoin is not based on sha-2 but on sha-256
😄😄😄
You are great! Toda raba!
Shalom ubracha-
thank u
Glad that you like it!
you sir are a legend
Thank you Jacobkurien. I am not a legend, but I think the world will be a better place if we learn to explain better. Clarity prevents mistakes and misuse.
Gideon Samid You, sir, are very humble! :)