Тёмный

Cryptography: Crash Course Computer Science #33 

CrashCourse
Подписаться 16 млн
Просмотров 812 тыс.
50% 1

Today we’re going to talk about how to keep information secret, and this isn’t a new goal. From as early as Julius Caesar’s Caesar cipher to Mary, Queen of Scots, encrypted messages to kill Queen Elizabeth in 1587, theres has long been a need to encrypt and decrypt private correspondence. This proved especially critical during World War II as Allan Turing and his team at Bletchley Park attempted to decrypt messages from Nazi Enigma machines, and this need has only grown as more and more information sensitive tasks are completed on our computers. So today, we’re going to walk you through some common encryption techniques such as the Advanced Encryption Standard (AES), Diffie-Hellman Key Exchange, and RSA which are employed to keep your information safe, private, and secure.
Note: 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: • Krack Attacks (WiFi WP...
Produced in collaboration with PBS Digital Studios: / pbsdigitalstudios
Want to know more about Carrie Anne?
about.me/carrieannephilbin
The Latest from PBS Digital Studios: • All PBS Digital Studio...
Want to find Crash Course elsewhere on the internet?
Facebook - / youtubecrash. .
Twitter - / thecrashcourse
Tumblr - / thecrashcourse
Support Crash Course on Patreon: / crashcourse
CC Kids: / crashcoursekids

Опубликовано:

 

17 май 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 339   
@crashcourse
@crashcourse 6 лет назад
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: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-mYtvjijATa4.html
@disorganizedorg
@disorganizedorg 6 лет назад
I very much appreciate that posted this update; it again demonstrates that you're more into education than simply getting clicks.
@SSGranor
@SSGranor 6 лет назад
Those expression should really have another "mod M".
@DreadKyller
@DreadKyller 6 лет назад
+Axyron That was a typo, it should have been "(B^Y mod M)^X mod M" it was missing the second modulus.
@DavidChipman
@DavidChipman 6 лет назад
Useless? How so?
@DavidChipman
@DavidChipman 6 лет назад
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.
@samuelisaac2984
@samuelisaac2984 4 года назад
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!
@KikomochiMendoza
@KikomochiMendoza 6 лет назад
As a total n00b in programming or encryption for some reason I understood the Debbie Hellman explanation over the paint trading analogy. Thanks.
@zikomo8913
@zikomo8913 5 лет назад
I was confused due to being color blind and had to re watch that part, lol.
@sam-yx8fr
@sam-yx8fr 4 года назад
Comrade Dyatlov hows it going so far
@Megamen8x
@Megamen8x 6 лет назад
*_COME ON BRAIN!!!!_*
@ThBlindElephant
@ThBlindElephant 5 лет назад
_404 Page not found_
@rodneynayo5779
@rodneynayo5779 4 года назад
Overload!.... HAHAHAHA!!!
@MrKydaman
@MrKydaman 6 лет назад
The "Thanks cryptography" 👍👍 at the end was pure gold.
@ChungusAm0ngus
@ChungusAm0ngus 6 лет назад
"Adding another level of... complexity" #trolled
@MisokoFukumoto
@MisokoFukumoto 6 лет назад
I fell for it too
@that_goofballrightthere5668
@that_goofballrightthere5668 5 лет назад
Tbh that whole intro and stuff is from complexity ssooo COPYRIGHT
@vezokpiraka
@vezokpiraka 6 лет назад
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.
@ProfessorSyndicateFranklai
@ProfessorSyndicateFranklai 6 лет назад
Just waiting for that quantum computer to mess all of our encryption up.
@Baxtexx
@Baxtexx 6 лет назад
We have to invent quantum cryptography then :D
@DharmaJannyter
@DharmaJannyter 6 лет назад
Actually, we already did a long time ago.^^ en.wikipedia.org/wiki/Quantum_cryptography
@nibblrrr7124
@nibblrrr7124 6 лет назад
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 ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE--LlkJZJ5DMQ.html and a mostly readable 2017 paper, "Post-quantum cryptography".
@sneakupakashgaur9935
@sneakupakashgaur9935 5 лет назад
No it won't
@christianalbertjahns2577
@christianalbertjahns2577 4 года назад
If quantum computer come to existence, then One-time Pad will be feasible to use
@watchit387
@watchit387 3 года назад
"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
@brocksprogramming
@brocksprogramming 6 лет назад
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
@banderi002 6 лет назад
Having a blue day? Keep Calm and Carrie Anne!
@JM-us3fr
@JM-us3fr 6 лет назад
Seriously, she always cheers me up
@Pfhorrest
@Pfhorrest 6 лет назад
They should sell this on a T-shirt.
@microbuilder
@microbuilder 6 лет назад
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?!
@kyoung21b
@kyoung21b 6 лет назад
Banderi - OK OK you get a big ughhhhh ! for that...
@day_saram
@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
@GKS225
@GKS225 6 лет назад
This is the best asymmetrical cryptography analogy I've seen so far! It makes so much sense to me. Thanks CC!
@BlueFlash215
@BlueFlash215 4 года назад
Wow, this was actually the exact right speed to follow, awesome graphics and amazing good comparisons. I'm actually a little happier now!
@donsample1002
@donsample1002 6 лет назад
I've always thought there was something shifty about that Hank guy.
@dcstone
@dcstone 6 лет назад
I did not realize there was so much to a secure connection... Amazing! Thanks for the explanation!
@ducksoop.x
@ducksoop.x 5 лет назад
Your Public/Private key explanation was the best I have ever seen, now I understand it! Thank you so much.
@ignaciocorrea6594
@ignaciocorrea6594 6 лет назад
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!).
@sneakupakashgaur9935
@sneakupakashgaur9935 5 лет назад
Ignacio Correa there is error in video
@davidporowski9512
@davidporowski9512 5 лет назад
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?)
@jeaniebeanie6
@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!
@alwync3253
@alwync3253 4 года назад
That's by far the best explanation of asymmetric encryption (in particular, Diffie-Hellman key exchange) I've come across.
@FakeButt
@FakeButt 6 лет назад
This is one of the best simple explanations of criptography ! Great work!
@drewlyton
@drewlyton 6 лет назад
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!
@SoulDragonWithFlow
@SoulDragonWithFlow 6 лет назад
Wow, I knew a few basics of encryption but was always quite hazy on the details. This was so informative! Thanks! :D
@sedthh
@sedthh 6 лет назад
wow this is the first time I got my head around how public keys work, please do more videos on the subject!
@christomapher
@christomapher 5 лет назад
I love the flying toasters! Obscure reference that brings me back to the 90s PC computing world!
@fabiomarsiaj8172
@fabiomarsiaj8172 4 года назад
I just love the way you explain everything!! Amazing course.
@gasquakestudios
@gasquakestudios 6 лет назад
Really good explanation of how the fact that no secret key needs to be exchanged!
@starryk79
@starryk79 6 лет назад
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!
@VitorVelosoSA
@VitorVelosoSA 5 лет назад
Finally I understand the key exchange, thanks to your color explanation. Very nice :)
@jackkraus6948
@jackkraus6948 2 месяца назад
I'm taking a software engineering technical interview and wanted to brush up quickly on this stuff, thanks Crash Course 👍
@Xappreviews
@Xappreviews 6 лет назад
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 :)
@mehdibounya
@mehdibounya 6 лет назад
Xappreviews yeah they didn't cover a really important part, the man in the middle attack, they should've mentioned certificates
@What_was_wrong_w_jst_our_names
The paint analogy was very useful
@tellingfoxtales
@tellingfoxtales 6 лет назад
The bit about key exchange was very informational.
@milestone2852
@milestone2852 6 лет назад
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 :)
@tenow
@tenow 6 лет назад
Finally! An understandable explanation how prime numbers work in cryptography with color metaphor.
@NickShvelidze
@NickShvelidze 6 лет назад
Awesome video, thank you! I can finally understand a little bit of cryptography.
@gustavlarsson1785
@gustavlarsson1785 6 лет назад
I really liked both the video's content and the narrator - She's great! Good job! :)
@FedJimSmith
@FedJimSmith 6 лет назад
We can more appreciate this by citing non-electronic ciphering/deciphering.. Good job mentioning Ceasar and Columnar
@max500k
@max500k 3 года назад
I love simple explanations of complicated things, awesome video
@eriksatterqvist6027
@eriksatterqvist6027 6 лет назад
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.
@Mr_Creasy_
@Mr_Creasy_ 6 лет назад
Very informative video!
@RichyMaths
@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.
@tommrutherford
@tommrutherford 6 лет назад
This series is so awesome!
@flopped3419
@flopped3419 6 лет назад
"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
@TravelTrivia
@TravelTrivia 6 лет назад
I love this channel! Awesome videos
@davidsweeney111
@davidsweeney111 6 лет назад
the wife has got the best cryptography, I dont understand her at all!
@the80386
@the80386 6 лет назад
don't they all?
@chasepablo5222
@chasepablo5222 6 лет назад
The real question is, who is she encrypting it for? 😏😏😏
@NeedForMadnessSVK
@NeedForMadnessSVK 5 лет назад
She is hashing, not encrypting
@rickh3714
@rickh3714 5 лет назад
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!
@markzucc3277
@markzucc3277 5 лет назад
Boomer humor
@DuluthTW
@DuluthTW 6 лет назад
Thanks, this episode really helped me.
@gnollins
@gnollins Год назад
Hands down the best video on cryptography on RU-vid. 12 minutes for expert level 😀
@annayapaymah7352
@annayapaymah7352 6 лет назад
Perfect description
@ratgreen
@ratgreen 6 лет назад
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
@Hofftari
@Hofftari 6 лет назад
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.
@lutze5086
@lutze5086 6 лет назад
ratgreen no, you just don't recognise the skills you learnt in school
@user-qj9gj5cw3b
@user-qj9gj5cw3b 6 лет назад
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 :)
@Lycz
@Lycz 6 лет назад
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).
@Tharindusri91
@Tharindusri91 5 лет назад
Thank you very very very much for this great video. It helped me a lot for understanding the fundamentals and history of Cryptography. :)
@ArjunSutar
@ArjunSutar 5 лет назад
This nice explanation you have given. Hope all needs to watch it.
@Arunk0320
@Arunk0320 5 лет назад
Thanks. This was an extremely informative video
@LeO-hm3tj
@LeO-hm3tj 5 лет назад
I fall in love at the end of the video~
@Ni7ram
@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
@sarielreigns777
@sarielreigns777 5 лет назад
Thank you for making me understand
@jameshoe1750
@jameshoe1750 6 лет назад
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?
@michelleschultze4641
@michelleschultze4641 6 лет назад
This is so interesting, wow!
@SergioBobillierC
@SergioBobillierC 6 лет назад
Great episode!
@gavin5861
@gavin5861 6 лет назад
Love these videos!
@Utkarshkharb
@Utkarshkharb Год назад
So well explained ! Thanks a lot !
@shalop5614
@shalop5614 5 лет назад
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.
@darioaguado5981
@darioaguado5981 5 лет назад
very informative . Good job!
@tilinapple
@tilinapple 6 лет назад
so proud when turing came up :)
@electroninja8768
@electroninja8768 6 лет назад
Nice video, I was really hoping for an illustration of one time pads though.
@yuvaldolev7969
@yuvaldolev7969 6 лет назад
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 ;)
@shalop5614
@shalop5614 5 лет назад
Yep and side channel attacks are the only crypanalysis attacks out there. There isn't a single other more common attack.
@griffdog8233
@griffdog8233 6 лет назад
Do you have any plans to do a future of computing video . Maybe have something about AI?
@hokageenergy9599
@hokageenergy9599 4 года назад
Tip: if you want to learn something, change the speed to .75
@windowsforvista
@windowsforvista 6 лет назад
This is a great video!
@hyunjinpark5086
@hyunjinpark5086 6 лет назад
Cracking open the code book with the bois
@moritzmakowski9422
@moritzmakowski9422 6 лет назад
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.
@loversdiscovers5099
@loversdiscovers5099 4 года назад
Great video guys!
@dabay200
@dabay200 6 лет назад
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.
@Lukeff7
@Lukeff7 6 лет назад
Great video, thank you!
@cholten99
@cholten99 6 лет назад
Nice Code Club shout-out - Claire and Linda will be happy :-).
@nandiking5608
@nandiking5608 5 лет назад
This was awesome :)
@AmanSingh-xc6xv
@AmanSingh-xc6xv 6 лет назад
Great video. Thanks
@k54ltyd28
@k54ltyd28 6 лет назад
You forgot to show the part where John has to call Daniel Biss and ask what an exponent is.
@DavidChipman
@DavidChipman 6 лет назад
Now that's *harsh* LMAO
@vikaskadel3005
@vikaskadel3005 4 года назад
Alan Turing blinking on the bug of engima was hilarious
@andrewgrebenisan6141
@andrewgrebenisan6141 6 лет назад
Absolutely beautiful
@arielcurra7647
@arielcurra7647 5 лет назад
Amazing animations
@songk5523
@songk5523 6 лет назад
at 4:20 how do we know for sure a letter can not repeat itself? Is there a proof or is it just experimental?
@maheshirk
@maheshirk 6 лет назад
Very informative
@nourchtioui3086
@nourchtioui3086 5 лет назад
EXCELLENT . Nawar
@LeezShadowbringer
@LeezShadowbringer 6 лет назад
I might be wrong but wouldn't B**xy mod M only have a range of [0, M] no matter what? If so then you'd need a fairly large number to modulus by otherwise you're not going to have many different possibilities for encryption.
@collinsmilgo8869
@collinsmilgo8869 4 года назад
The amount of times hank has been attacked lmao
@theblinkingbrownie4654
@theblinkingbrownie4654 4 года назад
Hey may need to go to -Hotel- Healthcare Trivago.
@nascomfub
@nascomfub Год назад
I love this!
@emmanueloshaddai3259
@emmanueloshaddai3259 6 лет назад
The details are amazing 🕺. Thank you Carrianne (mind the spelling)
@tgeo2880
@tgeo2880 5 лет назад
great video!
@PierreThierryKPH
@PierreThierryKPH 6 лет назад
OK, managing to get the Wilhelm Scream into a cryptography is an accomplishment in itself… \o/
@anshsachdeva2013
@anshsachdeva2013 4 года назад
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?
@brucelee7782
@brucelee7782 4 года назад
She forgot to add a extra mod on both sides 🙄
@EmmanuelHernandez-yz1wy
@EmmanuelHernandez-yz1wy 6 лет назад
Very well made video. You get a like! :)
@jeremybailey262
@jeremybailey262 4 года назад
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.
@ianrjm969
@ianrjm969 4 года назад
Thanks cryptography!
@dabay200
@dabay200 6 лет назад
I am totally confused by the colour example. If they both get the same grey colour in the end how does this help??, I thought they wanted to decipher each other's colours back to the original value which was green and blue??
@phantomapprentice6749
@phantomapprentice6749 11 месяцев назад
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.
@kareemrshaidat1794
@kareemrshaidat1794 6 лет назад
Have a good day everyone!
@kaptenteo
@kaptenteo 6 лет назад
I love sneaky Hank!
@AJVainio
@AJVainio 6 лет назад
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?
@wilfredevertsz1915
@wilfredevertsz1915 4 года назад
I have this same question in mind. It seems simple enough to solve. Let me know if you find the answer to your question.
Далее
Cybersecurity: Crash Course Computer Science #31
12:30
Просмотров 947 тыс.
У мамы в машине все найдется
00:38
Secret Codes: A History of Cryptography (Part 1)
12:09
Cracking the Uncrackable Code 😏
6:22
Просмотров 9 млн
7 Cryptography Concepts EVERY Developer Should Know
11:55
Operating Systems: Crash Course Computer Science #18
13:36
the new PS4 jailbreak is sort of hilarious
12:21
Просмотров 139 тыс.
The Mathematics of Cryptography
13:03
Просмотров 386 тыс.