Hey guys, there’s been a ton of news the past week about a vulnerability in the WPA2 protocol that protects our Wi-Fi networks, and since we say that AES is secure in this video, we thought it would be helpful to explain how it all relates. In October of 2017, researchers released a viable hack against WPA2, known as KRACK Attack, which uses AES to ensure secure communication between computers and network routers. The problem isn't with AES, which is provably secure, but with the communication protocol between router and computer. In order to set up secure communication, the computer and router have to agree through what's called a "handshake". If this handshake is interrupted in just the right way, an attacker can cause the handshake to fault to an insecure state and reveal critical information which makes the connection insecure. As is often the case with these situations, the problem is with an implementation, not the secure algorithm itself. Our friends over at Computerphile have a great video on the topic: kzbin.info/www/bejne/o4rXp52fn6aHl5Y
@disorganizedorg7 жыл бұрын
I very much appreciate that posted this update; it again demonstrates that you're more into education than simply getting clicks.
@SSGranor7 жыл бұрын
Those expression should really have another "mod M".
@DreadKyller7 жыл бұрын
+Axyron That was a typo, it should have been "(B^Y mod M)^X mod M" it was missing the second modulus.
@DavidChipman7 жыл бұрын
Useless? How so?
@DavidChipman7 жыл бұрын
You can slow the playback down, can't you? It's not too fast for me. But I have heard others mentioning changing the speed of playback of youtube videos in general.
@samuelisaac29844 жыл бұрын
I loved cryptography as a kid so much that I actually used to entertain myself with frequency analysis. I had a lot of books on cryptography, and I used to try to crack the examples before the book explained them, the way people try to solve mystery books before they reach the end. Now I'm falling in love with cryptography again, but with a more modern, computerized version. Thanks Crash Course!
@KikomochiMendoza7 жыл бұрын
As a total n00b in programming or encryption for some reason I understood the Debbie Hellman explanation over the paint trading analogy. Thanks.
@zikomo89135 жыл бұрын
I was confused due to being color blind and had to re watch that part, lol.
@sam-yx8fr4 жыл бұрын
Comrade Dyatlov hows it going so far
@Megamen8x7 жыл бұрын
*_COME ON BRAIN!!!!_*
@ThBlindElephant5 жыл бұрын
_404 Page not found_
@rodneynayo57794 жыл бұрын
Overload!.... HAHAHAHA!!!
@vezokpiraka7 жыл бұрын
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.
@MrKydaman7 жыл бұрын
The "Thanks cryptography" 👍👍 at the end was pure gold.
@brocksprogramming7 жыл бұрын
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.
@ProfessorSyndicateFranklai7 жыл бұрын
Just waiting for that quantum computer to mess all of our encryption up.
@Baxtexx7 жыл бұрын
We have to invent quantum cryptography then :D
@DharmaJannyter7 жыл бұрын
Actually, we already did a long time ago.^^ en.wikipedia.org/wiki/Quantum_cryptography
@nibblrrr71247 жыл бұрын
Actually, the most devastating quantum attack (Shor) only breaks asymmetric encryption (RSA, DH key exchange). Grover can weaken AES, but that isn't nearly as bad (speedup by at most the square root). Other algorithms, including some asymmetric ones, might not be affected at all. djb & Tanja Lange have a 32C3 talk kzbin.info/www/bejne/Y33PnH2Qf5p3g7M and a mostly readable 2017 paper, "Post-quantum cryptography".
@sneakupakashgaur99356 жыл бұрын
No it won't
@christianalbertjahns25775 жыл бұрын
If quantum computer come to existence, then One-time Pad will be feasible to use
@ChungusAm0ngus7 жыл бұрын
"Adding another level of... complexity" #trolled
@MisokoFukumoto6 жыл бұрын
I fell for it too
@that_goofballrightthere56685 жыл бұрын
Tbh that whole intro and stuff is from complexity ssooo COPYRIGHT
@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
@banderi0027 жыл бұрын
Having a blue day? Keep Calm and Carrie Anne!
@JM-us3fr7 жыл бұрын
Seriously, she always cheers me up
@Pfhorrest7 жыл бұрын
They should sell this on a T-shirt.
@microbuilder7 жыл бұрын
When I read that in my brain, I suddenly realized Carrie Anne does sound like carry on, if you live in the north as I do...soooo Minnesotan, dontcha know eh?!
@kyoung21b7 жыл бұрын
Banderi - OK OK you get a big ughhhhh ! for that...
@BlueFlash2154 жыл бұрын
Wow, this was actually the exact right speed to follow, awesome graphics and amazing good comparisons. I'm actually a little happier now!
@GKS2256 жыл бұрын
This is the best asymmetrical cryptography analogy I've seen so far! It makes so much sense to me. Thanks CC!
@ignaciocorrea65947 жыл бұрын
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!).
@sneakupakashgaur99356 жыл бұрын
Ignacio Correa there is error in video
@davidporowski95125 жыл бұрын
Ignacio Correa NSA (no such agency) spends serious taxpayer money to preserve email encryption/decryption using the Cypher Chip ( ironically, iirc, proposed by Bill & Hillary Clinton while in White House to preserve emails securely ) Sharing Key Info with NSA (WTF?)
@dcstone7 жыл бұрын
I did not realize there was so much to a secure connection... Amazing! Thanks for the explanation!
@ducksoop.x6 жыл бұрын
Your Public/Private key explanation was the best I have ever seen, now I understand it! Thank you so much.
@donsample10027 жыл бұрын
I've always thought there was something shifty about that Hank guy.
@Xappreviews7 жыл бұрын
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 :)
@mehdibounya7 жыл бұрын
Xappreviews yeah they didn't cover a really important part, the man in the middle attack, they should've mentioned certificates
@jackkraus69486 ай бұрын
I'm taking a software engineering technical interview and wanted to brush up quickly on this stuff, thanks Crash Course 👍
@watchit3874 жыл бұрын
"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
@ratgreen7 жыл бұрын
I have learnt more from a few Crash course videos than I did my entire XX years spent at school. Just goes to show education is not education its just there to make you pass tests, not to learn. Thanks CC. Thanks Alan Turing
@Hofftari7 жыл бұрын
It's not that simple. Sure, this is explained in an easy way, but our brains aren't capable of storing this information in a way that you can remember it easily in the future. These videos should in my opinion instead be seen as a support for the subject which you then learn through a more conventional way.
@lutze50867 жыл бұрын
ratgreen no, you just don't recognise the skills you learnt in school
@AthanasiosGrigoroudis7 жыл бұрын
The videos give you a taste of these subjects, just a scratch on the surface. You need education to learn how to study properly and get as much knowledge as you need. Don't hate school, it's normal to feel that way, but it's a lot more important than you think :)
@eriksatterqvist60277 жыл бұрын
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.
@drewlyton7 жыл бұрын
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!
@jeaniebeanie6 Жыл бұрын
This was such an amazing explanation. Perfectly paced, great graphics, fun analogies, easy to understand, and very well spoken. Thank you so much for this!
@alwync32534 жыл бұрын
That's by far the best explanation of asymmetric encryption (in particular, Diffie-Hellman key exchange) I've come across.
@gasquakestudios7 жыл бұрын
Really good explanation of how the fact that no secret key needs to be exchanged!
@hokageenergy95995 жыл бұрын
Tip: if you want to learn something, change the speed to .75
@starryk796 жыл бұрын
Fantastic Video. I finally understand how key exchange works. i always wondered how it can be secure if the keys need to be known to both parties. Now i know that! Thank you Carie-Anne!
@davidsweeney1117 жыл бұрын
the wife has got the best cryptography, I dont understand her at all!
@the803866 жыл бұрын
don't they all?
@chasepablo52226 жыл бұрын
The real question is, who is she encrypting it for? 😏😏😏
@NeedForMadnessSVK6 жыл бұрын
She is hashing, not encrypting
@rickh37145 жыл бұрын
Well a brute force attack will get you divorced I think so I don't recommend that! How about taking her on a phishing trip with you- If you promise to cook the catch and clean the dishes afterwards you may net that critical algorithm!
@markzucc32775 жыл бұрын
Boomer humor
@Lycz7 жыл бұрын
An interesting addition: The first version of Enigma, the one which had only 3 rotors has been cracked even before the beginning of WWII by 3 Polish mathematicians. Unfortunately their methods became obsolete the moment the 2 additional rotors have been added to the machine, making it again impossible do decipher Enigma until the Turing's breakthrough. (A commemorative memorial of the Polish input was placed in 2002 at Bletchley Park).
@VitorVelosoSA5 жыл бұрын
Finally I understand the key exchange, thanks to your color explanation. Very nice :)
@christomapher5 жыл бұрын
I love the flying toasters! Obscure reference that brings me back to the 90s PC computing world!
@shalop56146 жыл бұрын
B^Y mod M to the X is not equivelent to B^X mod M to the Y. You have to take the modulo afterwards, and it only works for very specific bases and modulos.
@sedthh7 жыл бұрын
wow this is the first time I got my head around how public keys work, please do more videos on the subject!
@RichyMaths Жыл бұрын
I did a course on Cryptography and Information Security in my degree. I remember we touched upon DES and AES, and other advanced topics such as elliptic curves.
@Mr_Creasy_7 жыл бұрын
Very informative video!
@tenow7 жыл бұрын
Finally! An understandable explanation how prime numbers work in cryptography with color metaphor.
@SoulDragonWithFlow7 жыл бұрын
Wow, I knew a few basics of encryption but was always quite hazy on the details. This was so informative! Thanks! :D
@gnollins2 жыл бұрын
Hands down the best video on cryptography on KZbin. 12 minutes for expert level 😀
@flopped34196 жыл бұрын
"so now you know all the _key_ parts of modern cryptography" , this woman makes me crease omg im dying thanks cryptography for bringing this woman to me the puns are fantastic
@fabiomarsiaj81724 жыл бұрын
I just love the way you explain everything!! Amazing course.
@FedJimSmith6 жыл бұрын
We can more appreciate this by citing non-electronic ciphering/deciphering.. Good job mentioning Ceasar and Columnar
@What_was_wrong_w_jst_our_names5 жыл бұрын
The paint analogy was very useful
@tellingfoxtales6 жыл бұрын
The bit about key exchange was very informational.
@moritzmakowski94227 жыл бұрын
9:43 That is not mathematically equivalent... See for example: b = 4, x = 3, y = 7, m = 18 You need to take the modulo M of the result to get the same key. In the wikipedia article about that topic they say, that b needs to be a generator of the group of m , but I haven't tried it out yet.
@collinsmilgo88695 жыл бұрын
The amount of times hank has been attacked lmao
@theblinkingbrownie46545 жыл бұрын
Hey may need to go to -Hotel- Healthcare Trivago.
@FakeButt7 жыл бұрын
This is one of the best simple explanations of criptography ! Great work!
@k54ltyd287 жыл бұрын
You forgot to show the part where John has to call Daniel Biss and ask what an exponent is.
@DavidChipman7 жыл бұрын
Now that's *harsh* LMAO
@yuvaldolev79697 жыл бұрын
Something you should have mentioned is that cryptography is only perfectly secure in theory - in the real world there are side channel attacks. Id explain it but I think that people who read this comment will have more fun researching this themselves ;)
@shalop56146 жыл бұрын
Yep and side channel attacks are the only crypanalysis attacks out there. There isn't a single other more common attack.
@Ni7ram Жыл бұрын
ive watched a GAZILLION videos on cryptography... and i always had the sensation that some part was missing, that it didnt make total sense.. i thought i was just dumb, but FINALLY someone explained it completely and clearly! best explanation EVER. all other videos forget to tell the public key is used in conjunction to the private to create something new. thats key! (pun intended) awesome job! this crash course is truly a masterpiece
@milestone28527 жыл бұрын
thanks for the awesome videos. this is one of my favourite channels on youtube. can you please do a series on Criminology and also Linguistics? thanks :)
@jeremybailey2625 жыл бұрын
Hot oil in the medieval ages wasn't used like you see it in Hollywood. Oil was an expensive resources so what they would actually do is pour boiling water or extremely hot sand. Yes there was some occasions where it happened but that's an exception not the norm as it's portrayed.
@TravelTrivia7 жыл бұрын
I love this channel! Awesome videos
@NickShvelidze7 жыл бұрын
Awesome video, thank you! I can finally understand a little bit of cryptography.
@LeO-hm3tj5 жыл бұрын
I fall in love at the end of the video~
@max500k4 жыл бұрын
I love simple explanations of complicated things, awesome video
@gustavlarsson17857 жыл бұрын
I really liked both the video's content and the narrator - She's great! Good job! :)
@dabay2006 жыл бұрын
With the modular exponent example if somebody in the middle intercepts both sides of the communication they get the same value for the shared key - i'm sure the NSA is already doing this, they already compromised RSA security and functions with backdoors to decrypt without using brute force.
@Danny_Boel7 жыл бұрын
0:30 Wilhelm scream!
@phantomapprentice6749 Жыл бұрын
I'm pretty bad at math and could understand this , well done. Although it does beg the question of why people consider math a requirement when the principles have more to do with logic than mathematics.
@tommrutherford7 жыл бұрын
This series is so awesome!
@nthgreen877 жыл бұрын
Guys, at 0:35 you used the picture of the monument dedicated to the 3 Polish mathematicians who first broke the Enigma cipher in 1932, making it possible for Turing et al. at Bletchley Park to proceed. Yet you didn't breathe a word of their contribution, nor did you even credit the photo (here it is on Wikipedia, recognizable by the digit order at the top: commons.wikimedia.org/wiki/File:Polish_cryptologists_breaking_Enigma_ciphers_monument_01.JPG ). I can understand that the English speaking world may be unwilling to break their tongues on names such as Różycki, but the complete erasure of the Polish contribution in ANY account of the Enigma-breaking is more than a little unfair.
@kareemrshaidat17946 жыл бұрын
Have a good day everyone!
@DuluthTW7 жыл бұрын
Thanks, this episode really helped me.
@AJVainio7 жыл бұрын
If my understanding is correct, it is crucial to the color-analogy that even if an eavesdropper has the shared color, and could theoretically "subtract" it from the two transmitted mixed colors to get the two secret colors, this subtraction-process is what would be prohibitively cumbersome?
@wilfredevertsz19154 жыл бұрын
I have this same question in mind. It seems simple enough to solve. Let me know if you find the answer to your question.
@annayapaymah73526 жыл бұрын
Perfect description
@michelleschultze46417 жыл бұрын
This is so interesting, wow!
@Wielki486 жыл бұрын
The first person to break the enigma code was Marian Rejewski and his colleagues, Polish mathematician, and he did it in 1932 ! Before outbreak of WW2 and certainly before Alan Turing. That's sad you don't mention it.
@PierreThierryKPH6 жыл бұрын
OK, managing to get the Wilhelm Scream into a cryptography is an accomplishment in itself… \o/
@tilinapple6 жыл бұрын
so proud when turing came up :)
@ArjunSutar6 жыл бұрын
This nice explanation you have given. Hope all needs to watch it.
@vikaskadel30054 жыл бұрын
Alan Turing blinking on the bug of engima was hilarious
@hyunjinpark50867 жыл бұрын
Cracking open the code book with the bois
@1035TheIce4 жыл бұрын
I like how Hank is the bad guy here 😂
@jameshoe17507 жыл бұрын
big fans of this series of videos, currently pursuing a diploma in IT. 'd to know if there is any plan for making a video about quantum computing?
@cholten997 жыл бұрын
Nice Code Club shout-out - Claire and Linda will be happy :-).
@just_jimmy6 жыл бұрын
You have very good videos, however i suggest you either decrease the amount or info or make a longer video. It’s a bit difficult following you with normal playback speed
@tgeo28805 жыл бұрын
great video!
@SergioBobillierC7 жыл бұрын
Great episode!
@cmilkau6 жыл бұрын
Amazing video! Can you also make a video on modern cryptography, focusing more on all the cool things not directly related to encryption? Hardly anyone knows there's so much more to cryptography than that. Only one minor objection: please don't reiterate the myth of million-year cryptoanalysis. Assuming Moore's law to continue, even the strongest encryptions in use today can be broken within decades.
@electroninja87687 жыл бұрын
Nice video, I was really hoping for an illustration of one time pads though.
@roidrage4206 жыл бұрын
"There will always be bugs..." (shows jQuery)
@Tharindusri916 жыл бұрын
Thank you very very very much for this great video. It helped me a lot for understanding the fundamentals and history of Cryptography. :)
@Sonicsis7 жыл бұрын
I never knew E was the most common letter used.
@IceMetalPunk7 жыл бұрын
You just used it 8 times in your comment. The two second-most common letters in your comment are T and N, both of which show up only 3 times each. It works! :D
@JosephDavies7 жыл бұрын
Watch a few episodes of Wheel of Fortune and you'll see them using letter frequency as the base strategy to solve the puzzles.
@MihiraTheAce7 жыл бұрын
I nxvxr knxw X was thx most common lxttxr usxd.
@MisokoFukumoto6 жыл бұрын
I had a challenge once to not use letter e in my introduction, I had to search up synonyms of every word that had e in it and reworded my sentence. I nailed it in the end.
@MisokoFukumoto6 жыл бұрын
In that paragraph, a particular syllabrary writing building block tally up to 17 counts, by its own. But, in this paragraph, it holds no display of it, as you may hold count.
@souvikcseiitk Жыл бұрын
3:20, nueral network 😅
@Utkarshkharb2 жыл бұрын
So well explained ! Thanks a lot !
@brocksprogramming7 жыл бұрын
Way to go Carrie Anne!
@windowsforvista7 жыл бұрын
This is a great video!
@kaptenteo7 жыл бұрын
I love sneaky Hank!
@griffdog82337 жыл бұрын
Do you have any plans to do a future of computing video . Maybe have something about AI?
@letylek4 жыл бұрын
4 minutes in and my head already hurts, this ain't for me
@gavin58617 жыл бұрын
Love these videos!
@sarielreigns7775 жыл бұрын
Thank you for making me understand
@SirPetterTheFirst7 жыл бұрын
Weird, My math teacher was going to show us cryptography tomorrow.(I'm studying in computer programing)
@jay68175 жыл бұрын
The Base and the Modulus lost me. The 80's style graphics helped though.
@anshsachdeva20134 жыл бұрын
hey carrie (or anyone else if you would like to help) , I wanted to understand that private key sharing( at 10:00) , so i thought of making myself a simple practical example out of it, but my calculations say your equation from 10:00 is not correct . can you please have a look? So If i have to transmit character '"P' (ascii 80 )from Boy A to B: >> I assumed x=2 would be private key of A and y=3 would be private key of B) >> I assumed my public key function as cipher(x,y)= (3^x % 7)^y Thus: - A would first Transfer cipher_a = 3^2%7 = 2 to B - B would first Transfer cipher_ a= 3^3%7 = 6 to A >> I assumed my publically available encryptor function as encrypted_text = cipher(B) ^x + ascii(character) - Thus, A would transfer the encrypted character 'P' to be as e_t = (6)^2+80 = 106 >> I assumed my publically available decryptor function as ascii(character) = encrypted_text - cipher(A) ^y - Thus, B would recieve the value as val = 106- (2)^3 = 97 , which is not equal to our original value of 80 Thus (B^y mod M)^x != (B^x mod M)^y != (B^xy mod M) But rather (B^yx mod M^x) == (B^xy mod M^y) but != B^xy %M Is this right?
@brucelee77824 жыл бұрын
She forgot to add a extra mod on both sides 🙄
@sneakupakashgaur99356 жыл бұрын
There should be one more modulas after the results in getting key.
@harshitpandey40275 жыл бұрын
It's very nicely presented with animation. Just one problem your Rate of speech is too fast/high. Very difficult to understand if the person is not a native English speaker