+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.
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
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.
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.
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.
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.
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
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?
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?
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?
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.
check out bitmint.com, or the book "Tethered Money: Managing Digital Currency Transactions" available on Amazon (Elsevier 2015), including digital edition.
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.
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!
u are the best professor.....i like ur method to explain the problems....thank you very much professor
I was going through hashing concepts, and this was a clear and crisp good explanation. Thank you
thanks for your kind words
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.
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.
You simplified hashing into a sentence...thank you for this clear explanation...
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!
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!
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!
awesome sir searched across google..found uh the best ....
Very nice Prof Gideon. Its very nice tutorial.
I was searching for hash and somehow ended up here.
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.
excellent explanation...almost give up trying to find out how it work on a simple way.
Thank you for the simplicity.
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.
very detailed explanation I hope if I can get more videos related to the cryptography topics
Thanks too much
Thank you sir for your beautiful explanation. Super.
very very good explanation . I salute you sir ji.
+nareshk kumar Thank you! My pleasure!
Awesome explanation Sir.
nice explanation sir!,,,u did well in this video,,and thanks
Wonderful explanation shalom to you
+Education Made Easy -- thank you, and Shalom!
Loved your explanation
Excellent Explaination.......
great explanation! thanks!
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
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.
I love this video thank you so much!!
Are Salts stored on the local machine? As there not stored in the database??
Finally I get it!
Thank you!
Thank you. Very informative
This guy is great.
You are great! Toda raba!
Shalom ubracha-
Hi,nice explanation. Can you please name encryption protocols having cipher size greater then plain text size. 😊
thank you sir! thanks a lots!
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.
Thank you prof. ! Toda Raba! :-)
Much appreciated.
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?
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 need to see some lectures abut minhash and minhash types please
Nice, short & effective
Thank you Sir!
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! :)
thank you
Thanks a lot!! 👏👏👏👏
#Gideonsamid 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.
Awesome
thank u
Glad that you like it!
lol - catch a few hi lights
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.
Lost me at l to the e. Poor delivery.
This sir looks like Walter white😂
bitcoin is not based on sha-2 but on sha-256
😄😄😄
2 advanced 4 me
salami 2 u
wtf is with the clicking...