@KikomochiMendoza
As a total n00b in programming or encryption for some reason I understood the Debbie Hellman explanation over the paint trading analogy. Thanks.
@vezokpiraka
This is probably one of the best Crash course videos ever made. Really great explanation and somehow more detailed than other ones while still explaining the concepts easily. This videos deserves praise.
@Megamen8x
COME ON BRAIN!!!!
@MrKydaman
The "Thanks cryptography" 👍👍 at the end was pure gold.
@brocksprogramming
I look forward to watching this every week. You guys at crash course are keen on the idea of the feynman technique. Making things as simple as possible. I find these videos on computers to be basically an overview of all the things I've studied over the years. It's a very complete and timely piece. Perhaps you guys may choose to go into more depth on some of these topics in the future. Anyway, these are a great introductory learning tool for those who are interested. Power to male and female programmers and tech nerds! While we ride the wave of the future.
@banderi002
Having a blue day? Keep Calm and Carrie Anne!
@ignaciocorrea6594
I love this course, and I'd like to add a little more information (due to the fact that CC cannot cover everything in just 15 minutes). First, when Carrie Ann says that one-way functions are "easy to do in one direction, but hard to reverse", "easy" and "hard" refer to computational complexity, specifically polynomial time problems. This means that the time needed to apply a one-way function must be small (a polynomial in the length of the argument of the function), but the time needed to reverse the computation must be awfully big. Second, the existence of one-way functions is an open problem in computer science. Modular exponentiation is a candidate for being a one-way function: indeed, computing the function is easy, even for huge numbers, but the reverse (the modular discrete logarithm) is believed to be difficult (but it has not been proved!).
@day_saram
i've been cracking my head open to understand how keys function for the past few weeks since uni started and you just explained it all very clearly with some paint.....insane and amazing, i thank you ALSO finally understanding the math that's behind these encryption techniques thank you so much
@ChungusAm0ngus
"Adding another level of... complexity" #trolled
@BlueFlash215
Wow, this was actually the exact right speed to follow, awesome graphics and amazing good comparisons. I'm actually a little happier now!
@watchit387
"For a 128-bit keys, you'd need trillions of years to try every combination, even if you used every single computer on the planet today. So you better get started" XD
@ProfessorSyndicateFranklai
Just waiting for that quantum computer to mess all of our encryption up.
@Xappreviews
I think it would be a great idea to make a second video where you talk about vulnerabilities of cryptography! For example, Diffie-Hellman is only secure against passive attacks; however you can fool both sides into thinking that a secure connection is established by a man-in-the-middle attack. There are different ways to eliminate this problem. Also public keys need to be stored in a secure source. If an attacker is able to distribute his own public key, it will lead to problems. There are many more examples, which could easily fill another video. I loved this one, it was a great introduction, but I wish you would go into more detail, especially since it might give the impression that these algorithms have no flaws :)
@GKS225
This is the best asymmetrical cryptography analogy I've seen so far! It makes so much sense to me. Thanks CC!
@drewlyton
It is uncanny how much this series is aligning with what I'm learning in my Defense Against the Dark Arts class haha! Sharing all of these with my professor! Keep 'em coming!
@erikatablob
In practical modular exponantiation you don't calculate the B^n before taking mod m since this number would be stupidly big and probably wont fit into memory. Instead you divide it into a series of taking power 2. If n = 2k is even, then B^n = (B^2)^k. If n = 2k+1 is odd, then B^n = B(B^2)^k. If B^2 > m, let C = B^2 mod m, then and (B^2)^k mod m = (B^2 mod m)^k = C^k (Also B(B^2)^k mod m = B(B^2 mod m)^k = BC^k). It is quite easy to code this if you want to give it a try.
@ducksoop.x
Your Public/Private key explanation was the best I have ever seen, now I understand it! Thank you so much.
@dcstone
I did not realize there was so much to a secure connection... Amazing! Thanks for the explanation!
@hokageenergy9599
Tip: if you want to learn something, change the speed to .75
@crashcourse