Don't you think that Eve is misunderstood? She's there, working hard to show that your protocols are secure and we call her the bad person. Imaginary actors in cryptographic proofs have feelings too!
Jeez, I wish this is how it was explained to me the first time. This was a brilliant video. And now I appreciate the brilliance of public key encryption. The idea of encrypting something twice, first with the other person's public key so only they can decrypt it, and then sign it with your own private key, so they know that you were legitimately the person sending it, is GENIUS. Thank you very, very much.
At this time 171 likes means 171 people had the same, including me! It always annoyed me that as an IT person I didn't understand this. But nobody ever explains the basics, they always make the explanation confusingly complex. Now I know!
Not really that brilliant. The whole idea relies on the belief that there exist one-way functions, i.e., it's very hard to calculate the inverse of such class of functions. Anyone can come up with the *idea* . It is the implementation that is hard as advanced mathematics is involved.
never ever understood public private key encryption decryption in this way, coming from a non-coding background the epiphany I had at 5:00 was just amazing, great explanation!!
Same here man. I really paused the video there - locked the system - went for a walk - for 10min, to digest what I just heard. (It also happened some days ago, when I first heard about encryption with private key)
It's crazy how after class and so many videos, only one of them finally makes sense (this one) and now when I start watching the other stuff it starts making sense. Every time I search for stuff now I hope I find a video from you guys with an explanation.
I've did a 4 year university course on computer networking and cyber security, and I understand private/public key better now than I did after that 4 years 😂
This was the first explanation I've seen that actually explained there was nothing special between the keys other than which one you personally made public or private. I never understood why anything done with your public key could only ever be undone with your private, but yet you could also sign emails with your private key to have them confirmed through the public without risking the private at all. Brilliant video.
You made my day.I am a Commerce student who had no idea about Public key and I needed to understand it because of IT subject in my course curriculum. I was totally frustrated and was not able to understand the concept from my book however by watching you video I got a basic idea about Public Key which is more than sufficient for my purpose.Thanks for the video.Love from India.
I was trying to get started on cryptography in my spare time and tried to understand the private/public key thing, but now it makes complete sense. Now I have to learn a bazillion more things and probably go to uni for computer science.
It's not exactly simple... but I am simplifying it and leaving out some of the more difficult parts. Encrypt R = kG mod p S = Px where P(x,y) = kQ mod p KDF(S) = ke || km Use ke in an asymmetric encryption scheme with the message, most of which xor information against a hash. This gives the encrypted message c. Run km and c through a message authentication code to get d. Encrypted message = R || c || d Decrypt S = Px where P(x,y) = qR mod p (because your private key times their random public key is equivalent to their random private key times your public key) Run S through KDF again to (hopefully) get the same ke || km. run c and km through the MAC and if it equals d then you can decrypt, if it doesn't, something went wrong. Run the inverse of the encryption scheme with ke and c to get the decrypted message m.
This is a very simple algorithm (that's somewhat similar to RSA, but way less secure): Pick any prime N. Then pick any two numbers P and Q such that when you multiply them together and subtract 1, the result will be divisible by N. For instance, we can let N = 19, P = 7, Q = 11. We see that this works because 7 × 11 - 1 = 76 = 4 × 19. Now to encrypt a message with the key P, we shall multiply it by P, divide by N and let the remainder be our encrypted message. For instance, if we want to encrypt the message M = 5, we would multiply 7 × 5 to get 35. Then we would divide by 19, which gives us 1 and 16 as the remainder. Therefore, our encrypted message is 16. To decrypt the message, we do the same thing again, only this time using our key Q. We multiply 16 by 11 to get 176, then divide this by 19, giving 9 and 5 as the remainder. Therefore, 5 is our decrypted result. This is our original message! Therefore, we have decrypted our message successfully. As the video mentioned, a message encrypted with P can only be decrypted with Q and vice versa. My example algorithm is pretty bad, though, as it is pretty easy to find Q given P and N, but other (more advanced) algorithms are much harder to crack, because you have to test every possible Q less than N (which is really hard if N is, say, 100 digits long).
A simple one is the cesar encryption that only consist on moving the letters around the alphabet by a certain key which is a number from 1 to 25. You get ABC transformed into a BCD with a key of 1 or the other way around i don't remember.
This is brilliant and these are words from a person who was a PhD supervisor and examiner. Sometimes people make it complicated because they don't understand it themselves fully.
This is a great explanation. I never understood the concept and it bothered me very much being an IT person. This is an exciting concept and I now understand the value of it.
Awesome! Very simply yet efficiently explained. So only asymmetric encryption (encrypting with other peer's public key) only ensures encryption, not authentication. But encryption with both own private key and other person's public key gives both authentication and encryption at the same time.
Let me see if I understand. The message is encrypted using the sender's private key and recipient's public key. The message is decrypted with the recipient's private key and sender's public key.
I understand that the more complicated explanation for this and yet fully appreciate your simplified description. Even when they full description of how it works is provided in chinhoyi start with your simplified description and then move on from there. Perfect perfect. Nice work!
Believe it or not, the movie SNEAKERS got me interested in the idea of crypto, and right around that time, Phil Zimmerman was becoming famous for having published pgp2.62 to the internet. That was illegal in the US at the time, which led to a lot of trouble for him (Google his name and ITAR and you will find it), and I have been encrypting my email to many friends, since then. Now I run GPG under linux, which is essentially an open source, more sophisticated implementation of PGP, and I highly recommend it. I also had the good fortune of meeting Phil at a lecture about 20 years ago and he signed my PGP users guide. I've also read most everything that Bruce Schneier has written on the subject, and subscribe to his newsletter. Something else I recommend. It's very entertaining and informative.
I must have heard dozens of different explanations of public key encryption, but this one is the first one that just makes sense for the big picture of it all!
Thank you for the oversimplification. As you say some things are simple at concept and then layers are built on top as they become more complex. To explain to a complete novice you need only make sure they understand the core concept. It reminds me of an ancient system used when there were only physical messengers running long distances with lockboxes to communicate. Person 1 would send the box with their padlock (A) to person 2. Person 2 would add their padlock (B) and send it back to person 1. Person 1 would then unlock padlock A and send it back to person 2 who would then unlock padlock B.
Okay, I think the reason I didn't understand this before was because it was explained by people who either didn't understand it themselves or oversimplified it little too much. It always sounded like there was only one public key which everyone shared.and used with their private key to code and decode messages. This made no sense, at least not to me. But if you have your unique public key which anyone can use to encode messages that only the you can decode, it would actually work. I wish I'd seen this vid when it came out; it would have saved me a lot time and brain scratching. Thank you.
@@RodneyDavis That's ok man. For me it was confusing at the beginning because I couldn't make my head around that a function can be capable of encrypting and decrypting with two different keys. that's thanks to RSA algorithm which it is used behind the scenes, which can make the magic. Just try another public-private key encryption video, it's gonna click eventually. Any doubts you have I can help, just bring them here.
I visualize 256 bit encryption like 2^256 railroads arranged in a circle so that they all point towards the middle (sort of like a clock with 2^256 positions), and they are also stacked 2^256 high. There is a rotatable platform in the middle that has a straight piece of railroad that can only connect two railroad-pieces at a time, to make a connection from one side to the other. At which position your track is on "the clock" is your public key. At which level your track is (height wise) is the private key. Combine them and you get the only possible way to connect the railroad for passage.
Well done! You obviously understand public key stuff well. It is so obvious when people who don't understand it try to explain it, they always mess it up.
Thank you. This was the third video I tried and I understand it now. There are two different processes to understand, and other educators were unable to clearly delineate them for me.
Nosey Nick And even that is a simplification when it comes to things like perfect forward secrecy. Because if someone records the communication you described and only later gets hold of the private key of one of the communication partner they can decrypt everything. If I understand it correctly this is fixed by another step where both communication partners generate yet another temporary asym. key pair, exchange the temp. public keys encrypted with the other public keys and use the temp. keys to exchange the symm. key and then immediately throw away the temp. asym. keys. Or something like that. Then the sym. key can never again be decrypted, even if the private key of both communication partners get leaked.
I would really enjoy seeing more videos like this. Privacy is in the spotlight right now and I can't explain things simply, so being able to link people to these videos is awesome.
What I would really be interested in watching is a video from Computerphile about what recently happened with TrueCrypt with respect to the author suddenly ending its development and suggesting what are clearly very poor alternatives. :)
This is an absolute peach, and kudos to the explainer. This is the only vid which explains, what happens when you encrypt a message with a sender's private key and the receiver's public key. +1
When used in reverse, it's called signing. When you hear cryptographers talk about digital signatures, this is what they're talking about. Just to clarify here, by "reverse" I don't mean public key being used to DEcrypt and the private to ENcrypt. They are always used for the same operation (public key for ENcryption, private key for DEcryption). What happens in reverse is the sequence of operations. When encipherment & concealment is desired, the plaintext is encrypted using the RECIPIENT'S public key, transmitted & decrypted by the private key. When signing is desired, the plaintext is DEcrypted using the SENDER'S private key, this is then transmitted & ENcrypted using the sender's public key to yield the original plain text. This works because public-key cryptographic algorithms have this property: D(E(plaintext) = E(D(plaintext)) = plaintext
totoritko ty... is this possible for all keypairs? or do they have to be generated specially to be able to do signing too? I have used public key encryption already but didnt know i could use them in reverse for signing
Kantenkugel keypairs have to be generated with an algorithm which involves prime numbers (big prime numbers, that's why there are super computers trying to calculate all the prime numbers)
Denis Dionigi Del Grande just for the record: (1) not every asymmetric cryptography system requires prime numbers (look for elliptic curve cryptoghraphy en.wikipedia.org/wiki/Elliptic_curve_cryptography) and (2) since prime numbers are infinite you can't compute *all* prime numbers (I know what you mean but it is just a clarification to be preciser).
Great video on how public key cryptography works on a basic level, while leaving out the mathematical why. Probably a good idea for newcomers to cryptography! To sum up the mathematical why: There are mathematical problems that humanity has yet to solve, that also seem truly unsolvable. If we include these "unsolvable" problems inside our cryptographic system, we can use their "unsolvability" to our advantage. By creating keys A and B using these "unsolvable" mathematical problems, we thereby basically force anyone trying to crack the system into solving these "unsolvable" problems first. I say "unsolvable" in quotes because we have not actually proved these problems to be unsolvable. However, the day these problems get solved, hacked cryptographic systems will be the least of, and just the beginning of, what will change the world forever because of them being solved.
One important thing: the key pair for decrypting incoming messages should never be the same as the key pair for signing outgoing messages. There are some clever attacks that allow someone to impersonate you or read your messages if you use the same pair for both ways. So you should have two key pairs.
Where has this video been all my life. Thank you. Excellent explanation, oversimplifications and all. Regarding that, sometimes it takes oversimplifying something so that you can see the elegance of it more clearly. The details will come later.
I do not understand how you solved the problem of agreeing on the key to encrypt with at all, I feel you just added one more step. How do you get the public key from a person while knowing the public key has not been modified? Are there public keys all the way down?
I may be completely wrong or misundertood your question, but let's see: instead of having to meet in secrecy, you can give your public key to anyone and everyone to see and encrypt messages with, but only you (or anyone you've given the private key to) can decrypt the messages. This way two spies could simply share their public keys so that the other spy can encrypt the message using it, but only the spy with the private key can decrypt it.
YumekuiNeru Right, I guess that would be troublematic... If the spies were modern people, they could simply publish the key online anywhere (like a pastebin file) and the other person could simply copy it from there. It doesn't matter if other people copy the key because they can only use it to encrypt messages, not decrypt them. I don't think I've properly understood this myself, so someone please correct me if I'm wrong.
Rented Mule No, you've got it right. Since it doesn't matter who has the public key, you could simply e-mail me and I could send it to you. Or post it on a tiny url page. Or post it to a mailbox. Or on Facebook. Once you have the public key, you can use it to encrypt "shared secret" keys that're used for encrypting messages to each other. Which is part of the simplification here: Public Key or Asymmetric Cryptography is just one part of a grandiose system, designed to allow you privacy and safe passage in the tumultuous internet waters.
Rented Mule yes but how do you as a visitor of a pastebin file know that the person who published that key is the person you think, or how do you know that key is the same as the one the person published?
what I would really like to understand is how they get made and how the algorithm to encrypt/decrypt works.. it makes no sense to me that you can encrypt something with a public key and other people with de public key cannot decode it..
It's called a trapdoor function in mathematics, that is: a function that's relatively easy to do one way but very difficult (read: practically impossible) to to the reverse. The closest everyday situation I can come up with is to imagine a person with a pen and piece of paper. Ask that person to square the number 213. Given some time and providing they know long multiplication they could probably work that out. However, if you ask them to square root the number 45369 they'd probably give up and go home. This is how public/private keys work--given one of the keys in the pair you can encrypt, but the maths is too hard to decrypt without the other key. If you're interested the keys are basically very large prime numbers, and you raise your message (represented as a number) to the power of one prime and then mod the result (taking the remainder after division) by the other prime.
Simple example. You have two dictionaries, English - Chinese and Chinese - English. You can encrypt text with first book quite easy, but its very hard to decrypt something with same book, it just don't do the trick, for that you need second dictionary.
A public key was never sent. Both public keys are available to anyone who looks for them. However, the private keys are never ever shared. So you encrypt your message with the OTHER person's public key, because that encryption can only be undone with the OTHER person's private key, which they already have and you don't need.
Best explanation ever! Really helped clarified the key point. One question: how do we know which public keys to use given that there must be millions of public keys out there? Do we know which public key is associated with the sender of the message?
Taking 2 nodes that communicate through a channel C. Each time nodes start communicating they exchange public keys.. its like i dont need to remember your name to start talking with you on the street next time we see each other.. I just go up to you and say, yo whats your name (or whats your public key?).. or even more.. what if you changed your name since we last spoke?
Sometimes just knowing the size of a message, when it was sent, from where and to where is enough to effectively guess the significance of an encrypted message. One encrypted message in a sea of unencrypted messages stands out. I guess the only solution is for everyone to be sending lots of encrypted garbage to each other all the time.
Well, you might now it is significant, but the problem is actually decrypting it. Sending lots of garbage to each other fills the system with unnecessary data and reduces efficiency/availability and so on.
What I don't get is why you can't figure out someone's private key from their public key. If one undoes what the other does doesn't that mean they are opposites of each other? Can't you just sort of reverse the public key and you would have the private key? I mean, obviously not because then this whole system wouldn't work but then why doesn't it work? A bigger question would be what exactly is the contents of these keys, is it just a large jumble of numbers or something?
You can, but that's like having "f(x) = y" and deriving x from y. If you have x, you just run the function to get y. But if you have y, you'll have to go through all possible x values to see which one ends as y. If you take the example of 1024-bit keys, that's 2^1024 possible values to check. It would just take too long to go through them all.
+Chosen One 41 the quick answer is: Yes it is possible but the time it would take to guess the very large random prime numbers used to generate the keys is so big, it would take millions of years to guess them. So this technique works because current computer processing is limited. And even if it didn't take 1million years, even if it only took 10 years to decrypt a communication based on public/private key. Would it be useful to find that facebook password or credit card number used today in 10 years? For all communication that is not "government secret" level this would mean you can't do anything useful with the info you get.
+Chosen One 41 the last layer you encrypted is the first layer you need to decrypt. Let's say there's p1, p2, s1, s2, (public key 1, public key 2, secret key 1, secret key 2). If you encrypt with p1, it must be decrypted by s1, and vice versa. Same for the second pair. So if you encrypt with s1 then p2, the other person first needs to decrypt the text using s2, then must decrypt the ciphertext generated by your private key, s1. The order matters. Rigorously (yes, I know I am using a key to mean cipher function but this is simpler to explain): Given a message M, the intermediate ciphertext becomes C = s1(M). The cipher text that the other person actually received is encrypted with their public key, p2: C' = p2(C). This means that C' = p2(s1(M) ) (by substitution). To decrypt, we apply the inverse functions in reverse order, M = p1( s2( p2( s1( M ) ) ) ), since s2 is the inverse of p2 and p1 is the inverse of s1,. First we get back to C by applying s2(C') to get C (since p2 ( s2 ( s1 ( M) ) ) ) = s1(M). Then we apply p1 ( C ) = p1( s1( M ) = M. The order is what makes this secure.
Joe Alias I had a feeling you meant that. By the way, ***** the page is a bit too far for me, but I think I can see that the point I didn't understand isn't explained there (or maybe it's just not said explicitly). What I actually didn't understand is how can the two keys be interchangeable without being compromised. (How can it be that the private key decrypts a public encryption and the public key decrypts a private encryption avoiding that the private key is reachable) I would guess that in this case you could somehow obtain the private key by analyzing how both the encryption and decryption with the public key work, because if they can decrypt each other it means that both the public encryption and decryption processes are strictly related to the private key. In brief, it seems to me that there are actually many data about the private key in the public key itself.
For this to work for "the masses", we'd need companies like Google, Apple and Microsoft to put their heads together, and provide a universal public key server/service across their respective platforms, and integrate its use into their products. The problem is, do we trust them enough to handle even the public keys?
***** That's for authentications. I'm thinking more about encryption, and getting that technology into the public sphere. Even with PGP and similar tools, meant to make this easy, it's really only used by the few, because it's not easy, and it requires the recipient to install special software as well. What if Google, Apple, Microsoft and other providers were tied into the public key services, and would automatically handle for instance authentication of incoming messages, should they have been signed, and in turn help you to generate the private key needed, and get its public key exported to the servers, in a nearly seamless manner.
Asbjørn Grandt you mean, so people could share encrypted and signed files with their friends? So for example if you circle someone on Google+ you get a copy of their public key and you can send files intended for them only?
***** That's not a bad idea. But also if someone sends you a signed message on for instance Gmail, it'll ask if you want to verify it. I know there are plug-ins (probably) and other email clients can do this. I would just like it to be built in, and active by default.
I'm just glad he called it an oversimplification, as there is quite a lot of maths involved utilizing phi, prime numbers etc. I love how by oversimplifying it, he made the theory behind it very accessible to anyone not even in the field of Computer Science. However once quantum computing comes out, this system may or may not need a replacement. ;)
The beautiful thing about Robert’s explanation is that it simplifies the math, but not so much the core process. There are techniques underlying the protocol, and techniques used on top of the protocol, but those are implementation details that will change over time. The protocol itself is timeless and perfectly expressed here.
Very well explained but I keep on finding it difficult to learn or become and expert trader by watching tutorials here on TH-cam until I was introduced to a licenced investor a great tutor and a mentor ,I must say Sir Brown is nothing but a genius.
I used to make loss trading crypto until I found people talking about the expertise of sir brown when it comes to the crypto market ...meeting sir Brown changed my life ..I no longer have to worry about debts because I invest another so I make huge profit trading with him
You know why so people use it? Because it can cost hundreds of dollars per year! The cheap ones: 100$ for a domain, 300$ for all company domains, 500$ for subdomain of one domain. Dafuck? It's like 1kb of data (public key, private key, company info, domain). This is the expensive storage system on the Internet.
workaround: Put a folder for public keys on an ftp server and just en/decrypt messages yourself (using software like OpenPGP), afterwards, paste the messages whereever you wanna send them to
There's a limited supply of prime numbers (edit: within a given finite range which can be stored on the computer), and a very large demand. That's why it costs money.
nunya biznez What... Did you read the whole thing and realize there isn't anything you could do but complain about it's length? Or is this another misdirection trick? Are you saying you don't have the mental fortitude to understand and reply appropriately? Do you ever think that maybe anger isn't the driving force in the universe? Why do you feel the need to project your anger issues onto everyone?
+nunya biznez nice nick. no, you're not trolling at all... OK (for the audience), not just evildoers (even though law enforcement knows their identity *because* they encrypted a message...), but also people installing software, publishing official documents, talking with attorneys, discussing trade secrets over the internet like before software is public, self-defense against terrorists and other criminals, talking with their bank, logging into any sites on the internet, buying anything on the internet, thwarting spies, checking for viruses... the list just goes on & on.
This is the most interesting stuff on Computerphile. Requesting a Cryptography/ Info security video series on this channel (like the postfix-notation stuff) please! You can talk about Diffie-Hellman key exchange + The maths behind key generation Data Integrity (checksums) Authenticity (digital signatures) Non-repudiation (signatures + public/private keys) Differences between Identification / Authentication / Authorization and the method that can be used to get them
Let me explain this: 1) You give your public key. 2) You decipher static. 3) You find what person can know what it said. 4) That’s the person who sent the message. In that way, you can move between channels and relocate targets.
Short simple and precise. Thanks Robert for explaining yet so complicated system in a simple way. You have widened my horizon much more than it was 6 minutes ago.
You didn't mention Alice or Bob.
oh boy, *that* will upset cryptographers
Don't you think that Eve is misunderstood? She's there, working hard to show that your protocols are secure and we call her the bad person.
Imaginary actors in cryptographic proofs have feelings too!
sent me on a laughing fit. Sorry for my shallow humor tolerance, but you sir, deserve a like. And a pat on the back. XD
Not to mention Eve, the Evil do-er.
Captain, please explain what is going on here.
Jeez, I wish this is how it was explained to me the first time. This was a brilliant video. And now I appreciate the brilliance of public key encryption. The idea of encrypting something twice, first with the other person's public key so only they can decrypt it, and then sign it with your own private key, so they know that you were legitimately the person sending it, is GENIUS. Thank you very, very much.
+Samuel Hobbs first encrypt using private key and then using public key. the same happens at decryption.
Wouldn't encrypting it with the public key as well mean that only the sender could decrypt it (using the private key)?
They don't encrypt with their public key--they encrypt with the public key of the recipient. That's the point you missed.
At this time 171 likes means 171 people had the same, including me! It always annoyed me that as an IT person I didn't understand this. But nobody ever explains the basics, they always make the explanation confusingly complex. Now I know!
Not really that brilliant. The whole idea relies on the belief that there exist one-way functions, i.e., it's very hard to calculate the inverse of such class of functions. Anyone can come up with the *idea* . It is the implementation that is hard as advanced mathematics is involved.
Wow this guy is really good on camera, would be nice to see him in more videos.
never ever understood public private key encryption decryption in this way, coming from a non-coding background the epiphany I had at 5:00 was just amazing, great explanation!!
Same here man.
I really paused the video there - locked the system - went for a walk - for 10min, to digest what I just heard.
(It also happened some days ago, when I first heard about encryption with private key)
ok?
It's crazy how after class and so many videos, only one of them finally makes sense (this one) and now when I start watching the other stuff it starts making sense. Every time I search for stuff now I hope I find a video from you guys with an explanation.
You explained this better in 6 mins than my lecturer did in a whole semester. Thank you.
Right. Professors waste time of time using outdated education methods.
same here bro!
Phoenix College too?
I've did a 4 year university course on computer networking and cyber security, and I understand private/public key better now than I did after that 4 years 😂
Cryptographers are upset because you didn't mention "Alice or Bob or THE EVE!"
Alice----------> Trudy ------------> Bob
I am the Bob they speak of in the examples
This was the first explanation in about 5 on public key cryptography where I had my lightbulb moment - thank you!
ok?
It was lightning. And then it was thunder!
This was the first explanation I've seen that actually explained there was nothing special between the keys other than which one you personally made public or private.
I never understood why anything done with your public key could only ever be undone with your private, but yet you could also sign emails with your private key to have them confirmed through the public without risking the private at all.
Brilliant video.
You made my day.I am a Commerce student who had no idea about Public key and I needed to understand it because of IT subject in my course curriculum.
I was totally frustrated and was not able to understand the concept from my book however by watching you video I got a basic idea about Public Key which is more than sufficient for my purpose.Thanks for the video.Love from India.
I love listening to that guy. His use of examples and explaining is out of this world. Please more videos! Whatever it might be about
yes, he makes videos about ai and ml on his channel
@@afr0z what's his channel..?
@@deekshithathota5204 Robert Miles AI Safety
I was trying to get started on cryptography in my spare time and tried to understand the private/public key thing, but now it makes complete sense.
Now I have to learn a bazillion more things and probably go to uni for computer science.
I'd like to see some simple algorithms on how exactly information is encrypted and decrypted with the keys.
lmgtfy.com/?q=simple+encryption+algorithm
You're welcome
It's not exactly simple... but I am simplifying it and leaving out some of the more difficult parts.
Encrypt
R = kG mod p
S = Px where P(x,y) = kQ mod p
KDF(S) = ke || km
Use ke in an asymmetric encryption scheme with the message, most of which xor information against a hash. This gives the encrypted message c.
Run km and c through a message authentication code to get d.
Encrypted message = R || c || d
Decrypt
S = Px where P(x,y) = qR mod p (because your private key times their random public key is equivalent to their random private key times your public key)
Run S through KDF again to (hopefully) get the same ke || km.
run c and km through the MAC and if it equals d then you can decrypt, if it doesn't, something went wrong.
Run the inverse of the encryption scheme with ke and c to get the decrypted message m.
This is a very simple algorithm (that's somewhat similar to RSA, but way less secure):
Pick any prime N. Then pick any two numbers P and Q such that when you multiply them together and subtract 1, the result will be divisible by N.
For instance, we can let N = 19, P = 7, Q = 11. We see that this works because 7 × 11 - 1 = 76 = 4 × 19.
Now to encrypt a message with the key P, we shall multiply it by P, divide by N and let the remainder be our encrypted message. For instance, if we want to encrypt the message M = 5, we would multiply 7 × 5 to get 35. Then we would divide by 19, which gives us 1 and 16 as the remainder. Therefore, our encrypted message is 16.
To decrypt the message, we do the same thing again, only this time using our key Q. We multiply 16 by 11 to get 176, then divide this by 19, giving 9 and 5 as the remainder. Therefore, 5 is our decrypted result. This is our original message! Therefore, we have decrypted our message successfully.
As the video mentioned, a message encrypted with P can only be decrypted with Q and vice versa. My example algorithm is pretty bad, though, as it is pretty easy to find Q given P and N, but other (more advanced) algorithms are much harder to crack, because you have to test every possible Q less than N (which is really hard if N is, say, 100 digits long).
watch?v=M7kEpw1tn50 RSA from Numberphile
A simple one is the cesar encryption that only consist on moving the letters around the alphabet by a certain key which is a number from 1 to 25.
You get ABC transformed into a BCD with a key of 1 or the other way around i don't remember.
I just waste my time watching other channels for this kind of stuff when I know in the end this is where the real juice is. Impeccable.
Really he has oversimplified it...no one can simplify it more than him in just 6 minutes. Great man!!
This is brilliant and these are words from a person who was a PhD supervisor and examiner. Sometimes people make it complicated because they don't understand it themselves fully.
This is a great explanation. I never understood the concept and it bothered me very much being an IT person. This is an exciting concept and I now understand the value of it.
Awesome! Very simply yet efficiently explained.
So only asymmetric encryption (encrypting with other peer's public key) only ensures encryption, not authentication. But encryption with both own private key and other person's public key gives both authentication and encryption at the same time.
Let me see if I understand.
The message is encrypted using the sender's private key and recipient's public key.
The message is decrypted with the recipient's private key and sender's public key.
Yes.
Only if you want to "sign" your message.
Xiaochen Li If you encrypt a message without "signing" it. Which keys are needed to encrypt and decrypt the message?
XD
If you don't want to "sign" your message, you encrypt the message with the recipient's public key and he will decrypt it with his private key.
He's style of telling is perfect. Simplicity of his sentences shows how great his knowledge
Yes, pan down and show us his private key...
I understand that the more complicated explanation for this and yet fully appreciate your simplified description. Even when they full description of how it works is provided in chinhoyi start with your simplified description and then move on from there. Perfect perfect. Nice work!
Believe it or not, the movie SNEAKERS got me interested in the idea of crypto, and right around that time, Phil Zimmerman was becoming famous for having published pgp2.62 to the internet. That was illegal in the US at the time, which led to a lot of trouble for him (Google his name and ITAR and you will find it), and I have been encrypting my email to many friends, since then. Now I run GPG under linux, which is essentially an open source, more sophisticated implementation of PGP, and I highly recommend it. I also had the good fortune of meeting Phil at a lecture about 20 years ago and he signed my PGP users guide.
I've also read most everything that Bruce Schneier has written on the subject, and subscribe to his newsletter. Something else I recommend. It's very entertaining and informative.
This is the clearest explanation I've ever seen for asymmetric cryptography.
I think a numberphile on Fermat's little theorem and how the special primes are used to generate key pairs would be cool
I must have heard dozens of different explanations of public key encryption, but this one is the first one that just makes sense for the big picture of it all!
Thank you! Finally a video that explains what public keys are!!
Thank you for the oversimplification. As you say some things are simple at concept and then layers are built on top as they become more complex. To explain to a complete novice you need only make sure they understand the core concept.
It reminds me of an ancient system used when there were only physical messengers running long distances with lockboxes to communicate. Person 1 would send the box with their padlock (A) to person 2. Person 2 would add their padlock (B) and send it back to person 1. Person 1 would then unlock padlock A and send it back to person 2 who would then unlock padlock B.
Does anyone else thing that this guy would do great at playing a young Wolverine?
omg yessss
No, noone else.
Six years ago..... where are we going Rob?
This guy is an untapped resource for education.
the message always says hello
One wonders why they even bother to encrypt it, everyone already knows what it says.
***** Possibly the amount of likes on there comment
***** Tommy Sandal Actually, a sense of humor is usually considered a sign of intelligence.
That's quite funny
And probably the sender is Alice
Okay, I think the reason I didn't understand this before was because it was explained by people who either didn't understand it themselves or oversimplified it little too much. It always sounded like there was only one public key which everyone shared.and used with their private key to code and decode messages. This made no sense, at least not to me. But if you have your unique public key which anyone can use to encode messages that only the you can decode, it would actually work. I wish I'd seen this vid when it came out; it would have saved me a lot time and brain scratching. Thank you.
This video was soooooooo clear and helpful. That was FANTASTIC!
Lol. You’re smarter than me for sure. Even this I couldn’t make sense from.
@@RodneyDavis That's ok man. For me it was confusing at the beginning because I couldn't make my head around that a function can be capable of encrypting and decrypting with two different keys. that's thanks to RSA algorithm which it is used behind the scenes, which can make the magic. Just try another public-private key encryption video, it's gonna click eventually. Any doubts you have I can help, just bring them here.
I visualize 256 bit encryption like 2^256 railroads arranged in a circle so that they all point towards the middle (sort of like a clock with 2^256 positions), and they are also stacked 2^256 high. There is a rotatable platform in the middle that has a straight piece of railroad that can only connect two railroad-pieces at a time, to make a connection from one side to the other.
At which position your track is on "the clock" is your public key.
At which level your track is (height wise) is the private key.
Combine them and you get the only possible way to connect the railroad for passage.
Thanks for the simple and thorough explanation, more videos from this guy please
Great explanation. Although I am quite late to this world but this way of teaching does help.
Brilliant! I wish I'd picked this knowledge up earlier.
ok?
Well done! You obviously understand public key stuff well. It is so obvious when people who don't understand it try to explain it, they always mess it up.
oh god, that marker on paper noise is killing me!!!
Yeah. It does put my teeth on edge a bit. They should try taking it out with a de-esser or something.
Allan Meters it's ASMR for me. Very relaxing
Using the pointy end of the marker is worse to me.
I always write like that xD even when I have normal pen
Sends shivers across my body
Just watched a dozen videos on this....this is BY FAR the best explanation. Thanks.
This guy is great
Perfectly explained
why is this filmed so aesthetically 💅
that camera tilt👩🎨
More Crypto-Stuff, please!
Thank you. This was the third video I tried and I understand it now. There are two different processes to understand, and other educators were unable to clearly delineate them for me.
So can any cryptographers tell me what was "overly simplified?" Can somebody direct me to a source, so I can learn more about this?
Nosey Nick And even that is a simplification when it comes to things like perfect forward secrecy. Because if someone records the communication you described and only later gets hold of the private key of one of the communication partner they can decrypt everything. If I understand it correctly this is fixed by another step where both communication partners generate yet another temporary asym. key pair, exchange the temp. public keys encrypted with the other public keys and use the temp. keys to exchange the symm. key and then immediately throw away the temp. asym. keys. Or something like that. Then the sym. key can never again be decrypted, even if the private key of both communication partners get leaked.
You explained very clearly that a normal person without the knowledge of cryptography can also understand 👌
i wasn't doing Ceasar cipher when I was a kid...
Before this video, I didn't know that I didn't know what is Public/Asymmetric Encryption. Beautiful Explanation.
Amazing how many preppers are to lazy to use this
Operational security eludes many
I would really enjoy seeing more videos like this. Privacy is in the spotlight right now and I can't explain things simply, so being able to link people to these videos is awesome.
What I would really be interested in watching is a video from Computerphile about what recently happened with TrueCrypt with respect to the author suddenly ending its development and suggesting what are clearly very poor alternatives. :)
This is an absolute peach, and kudos to the explainer. This is the only vid which explains, what happens when you encrypt a message with a sender's private key and the receiver's public key. +1
I didnt know that the system is bidirectional / you can encrypt with private key and decrypt with public... thought it was only the other way around
When used in reverse, it's called signing. When you hear cryptographers talk about digital signatures, this is what they're talking about.
Just to clarify here, by "reverse" I don't mean public key being used to DEcrypt and the private to ENcrypt. They are always used for the same operation (public key for ENcryption, private key for DEcryption). What happens in reverse is the sequence of operations. When encipherment & concealment is desired, the plaintext is encrypted using the RECIPIENT'S public key, transmitted & decrypted by the private key. When signing is desired, the plaintext is DEcrypted using the SENDER'S private key, this is then transmitted & ENcrypted using the sender's public key to yield the original plain text. This works because public-key cryptographic algorithms have this property:
D(E(plaintext) = E(D(plaintext)) = plaintext
totoritko ty... is this possible for all keypairs? or do they have to be generated specially to be able to do signing too?
I have used public key encryption already but didnt know i could use them in reverse for signing
Kantenkugel All private keys can sign and decrypt and all public keys can verify and encrypt. Nothing special is required.
Kantenkugel keypairs have to be generated with an algorithm which involves prime numbers (big prime numbers, that's why there are super computers trying to calculate all the prime numbers)
Denis Dionigi Del Grande just for the record: (1) not every asymmetric cryptography system requires prime numbers (look for elliptic curve cryptoghraphy en.wikipedia.org/wiki/Elliptic_curve_cryptography) and (2) since prime numbers are infinite you can't compute *all* prime numbers (I know what you mean but it is just a clarification to be preciser).
U hooked me with the Greenbar!!! I'm a programmer from the 70's and that was what we used. thanks for your great explanation
You should do a follow up on DiffieHellman Key exchange. It's really simple to implement!
I second this!
They did it a while back!
does gnupg does this (DiffieHellman Key exchange)?
I dropped all of my computer science classes and changed majors because I could not grasp this basic concept!!! This guy explained it in 5 minutes!!!!
>obi one
I know, right! His name is Obee-Juan!
Great video on how public key cryptography works on a basic level, while leaving out the mathematical why. Probably a good idea for newcomers to cryptography!
To sum up the mathematical why: There are mathematical problems that humanity has yet to solve, that also seem truly unsolvable. If we include these "unsolvable" problems inside our cryptographic system, we can use their "unsolvability" to our advantage. By creating keys A and B using these "unsolvable" mathematical problems, we thereby basically force anyone trying to crack the system into solving these "unsolvable" problems first.
I say "unsolvable" in quotes because we have not actually proved these problems to be unsolvable. However, the day these problems get solved, hacked cryptographic systems will be the least of, and just the beginning of, what will change the world forever because of them being solved.
One important thing: the key pair for decrypting incoming messages should never be the same as the key pair for signing outgoing messages. There are some clever attacks that allow someone to impersonate you or read your messages if you use the same pair for both ways. So you should have two key pairs.
+Jan Sten Adámek Why and how? I'm interested to know.
+Jan Sten Adámek can you explain those attacks or forward me a link please?
Jan Sten Adámek thx I'll look at it :)
+Lobster with Mustard and Rice Was there a link sent? I'm also interested in this example, can you forward to me?
+David Engelhardt if it got forwarded to you can you just post it publicly. pls
Where has this video been all my life. Thank you. Excellent explanation, oversimplifications and all. Regarding that, sometimes it takes oversimplifying something so that you can see the elegance of it more clearly. The details will come later.
Yes, good explanation. But what are Alice, Bob and Eve doing while this is going on?
Hunting down Carol.
Just learned about public key cryptography from Mungo Jerry and I love it! Seriously, with your help, I was able to pass my Security+ (first attempt)!
0:38 *paranoid look*
The best explanation for Asymmetric key cryptography
I do not understand how you solved the problem of agreeing on the key to encrypt with at all, I feel you just added one more step. How do you get the public key from a person while knowing the public key has not been modified?
Are there public keys all the way down?
I may be completely wrong or misundertood your question, but let's see: instead of having to meet in secrecy, you can give your public key to anyone and everyone to see and encrypt messages with, but only you (or anyone you've given the private key to) can decrypt the messages.
This way two spies could simply share their public keys so that the other spy can encrypt the message using it, but only the spy with the private key can decrypt it.
how do they share their public keys?
YumekuiNeru Right, I guess that would be troublematic... If the spies were modern people, they could simply publish the key online anywhere (like a pastebin file) and the other person could simply copy it from there.
It doesn't matter if other people copy the key because they can only use it to encrypt messages, not decrypt them.
I don't think I've properly understood this myself, so someone please correct me if I'm wrong.
Rented Mule No, you've got it right. Since it doesn't matter who has the public key, you could simply e-mail me and I could send it to you. Or post it on a tiny url page. Or post it to a mailbox. Or on Facebook.
Once you have the public key, you can use it to encrypt "shared secret" keys that're used for encrypting messages to each other. Which is part of the simplification here: Public Key or Asymmetric Cryptography is just one part of a grandiose system, designed to allow you privacy and safe passage in the tumultuous internet waters.
Rented Mule yes but how do you as a visitor of a pastebin file know that the person who published that key is the person you think, or how do you know that key is the same as the one the person published?
I know cryptography, your explanation is wonderful. No need to go into technical details of the algorithms involved. Well done!!
That is clever. Granted now there are bigger fish to fry because this is only the beginning.
Gold this Video is!! Making sense of the PKI within 3 minutes!!! So great to be alive at this time!
"look down in my trousers, where there's a lot of commenters" xD
This is the most well constructed explanation I've seen yet.
what I would really like to understand is how they get made and how the algorithm to encrypt/decrypt works.. it makes no sense to me that you can encrypt something with a public key and other people with de public key cannot decode it..
It's called a trapdoor function in mathematics, that is: a function that's relatively easy to do one way but very difficult (read: practically impossible) to to the reverse.
The closest everyday situation I can come up with is to imagine a person with a pen and piece of paper. Ask that person to square the number 213. Given some time and providing they know long multiplication they could probably work that out. However, if you ask them to square root the number 45369 they'd probably give up and go home.
This is how public/private keys work--given one of the keys in the pair you can encrypt, but the maths is too hard to decrypt without the other key.
If you're interested the keys are basically very large prime numbers, and you raise your message (represented as a number) to the power of one prime and then mod the result (taking the remainder after division) by the other prime.
boss!
Simple example.
You have two dictionaries, English - Chinese and Chinese - English. You can encrypt text with first book quite easy, but its very hard to decrypt something with same book, it just don't do the trick, for that you need second dictionary.
So what keeps someone from intercepting the public key so they can read the message? was it sent metaphorically separately?
A public key was never sent. Both public keys are available to anyone who looks for them. However, the private keys are never ever shared. So you encrypt your message with the OTHER person's public key, because that encryption can only be undone with the OTHER person's private key, which they already have and you don't need.
This is the simplest explanation of such a beautiful idea
"..everyone and his dog" XD
Best explanation ever! Really helped clarified the key point. One question: how do we know which public keys to use given that there must be millions of public keys out there? Do we know which public key is associated with the sender of the message?
Taking 2 nodes that communicate through a channel C. Each time nodes start communicating they exchange public keys.. its like i dont need to remember your name to start talking with you on the street next time we see each other.. I just go up to you and say, yo whats your name (or whats your public key?).. or even more.. what if you changed your name since we last spoke?
Sometimes just knowing the size of a message, when it was sent, from where and to where is enough to effectively guess the significance of an encrypted message. One encrypted message in a sea of unencrypted messages stands out. I guess the only solution is for everyone to be sending lots of encrypted garbage to each other all the time.
Well, you might now it is significant, but the problem is actually decrypting it.
Sending lots of garbage to each other fills the system with unnecessary data and reduces efficiency/availability and so on.
Studying for Security Fundamentals for Cisco's CyberOps and this video explained things very clearly. Thank you!
What I don't get is why you can't figure out someone's private key from their public key. If one undoes what the other does doesn't that mean they are opposites of each other? Can't you just sort of reverse the public key and you would have the private key? I mean, obviously not because then this whole system wouldn't work but then why doesn't it work?
A bigger question would be what exactly is the contents of these keys, is it just a large jumble of numbers or something?
+Chosen One 41 A key looks something like this...
-----BEGIN CERTIFICATE-----
MIIDBzCCAe+gAwIBAgIJAL6xD+LpwcWhMA0GCSqGSIb3DQEBBQUAMBoxGDAWBgNV
BAMMD3d3dy5leGFtcGxlLmNvbTAeFw0xNjAxMDYxNDIwNDZaFw0yNjAxMDMxNDIw
NDZaMBoxGDAWBgNVBAMMD3d3dy5leGFtcGxlLmNvbTCCASIwDQYJKoZIhvcNAQEB
BQADggEPADCCAQoCggEBAM1YVdJj10e/4pkXo9I029HrxWTR6TDN9sc82KkxggeX
5e33bSTwtxI6f7e0dO07bjPvrN/tTebdKRTK83wu62mdjuajVWgWecUp0AtP7GYs
9WfLfecWRlydKpaUh2gyVL7oM/jnMKFi49YeRxpYPwqX+D/C5QB4I8yAiwolcosN
9amL6E7JT3vIR8Gne5xit0lpaW86uw92dyB1WHkFUQkj3ny5MEhXYOIc4anlgDWC
vL2LhpwCpgLagKE+3/wTAWjLgFAB75xKqfYbb3FZSUzz6xUBhQ1XsgoBTbcGhvc8
UeQ0Ok6w1XDm41DxEUvB3FqJt76W0YW4cSob2X+Rf+MCAwEAAaNQME4wHQYDVR0O
BBYEFG8cYrrtLs8Sc4RJgc8hsxiwUoSAMB8GA1UdIwQYMBaAFG8cYrrtLs8Sc4RJ
gc8hsxiwUoSAMAwGA1UdEwQFMAMBAf8wDQYJKoZIhvcNAQEFBQADggEBAHxX9Q1b
WxLC10ZrIAkArULUwOmjTRfUZ+Ty+6hw6SJ+2W39iDRpacN+IguNos/f1opYfz6b
lTkIH7OMyuTGQ0HeoUO7h37jxE9qNABtZAVWz93WZvqYtC0PH1cXVRhIlQB5W7fd
+89gBI1ptFmhGS2SOlOt4pa4G4XSMqsYoDk69pvg5v6egs1kBcmdC1MvLAb9SFBz
/OEWSlaIA1dpJxmV4VKQPKMcNAouAbgWIareCOQcGjEnS5o5lp/U3HFhqigWGnGB
NsLMrZeGdnEwXlx6uoYIU9W5Z/F+ji8RkY8jOugvYybQth35B3PuTluNUYMviEJE
b+fCWkRdkh7CBm0=
-----END CERTIFICATE-----
You can, but that's like having "f(x) = y" and deriving x from y. If you have x, you just run the function to get y. But if you have y, you'll have to go through all possible x values to see which one ends as y. If you take the example of 1024-bit keys, that's 2^1024 possible values to check. It would just take too long to go through them all.
+Chosen One 41 the quick answer is: Yes it is possible but the time it would take to guess the very large random prime numbers used to generate the keys is so big, it would take millions of years to guess them. So this technique works because current computer processing is limited.
And even if it didn't take 1million years, even if it only took 10 years to decrypt a communication based on public/private key. Would it be useful to find that facebook password or credit card number used today in 10 years? For all communication that is not "government secret" level this would mean you can't do anything useful with the info you get.
+Chosen One 41 the last layer you encrypted is the first layer you need to decrypt. Let's say there's p1, p2, s1, s2, (public key 1, public key 2, secret key 1, secret key 2).
If you encrypt with p1, it must be decrypted by s1, and vice versa. Same for the second pair. So if you encrypt with s1 then p2, the other person first needs to decrypt the text using s2, then must decrypt the ciphertext generated by your private key, s1. The order matters. Rigorously (yes, I know I am using a key to mean cipher function but this is simpler to explain):
Given a message M, the intermediate ciphertext becomes C = s1(M). The cipher text that the other person actually received is encrypted with their public key, p2: C' = p2(C). This means that C' = p2(s1(M) ) (by substitution). To decrypt, we apply the inverse functions in reverse order, M = p1( s2( p2( s1( M ) ) ) ), since s2 is the inverse of p2 and p1 is the inverse of s1,.
First we get back to C by applying s2(C') to get C (since p2 ( s2 ( s1 ( M) ) ) ) = s1(M). Then we apply p1 ( C ) = p1( s1( M ) = M.
The order is what makes this secure.
Not with *todays* supercomputers ;)
Just wait until the future, where keys must get even bigger...
This is the Best explanation I've ever come across on public cryptography key.🔥🔥
I want the complicated version :D
3 years passed and I hope you dont need it :)
@@prana6854 not need just want
@@larax222 i would honestly like to see it too, i'm scrolling through the comments not finding anything
I think he goes to the same hairstylist as Martyn Poliakoff!
Fantastic video -- I've not seen this explained so clearly anywhere.
This is kinda cool, but I'd be much more interested in understanding how this key-pair works, I don't understand how can it.
Not sure if this helps, but here goes. This is the most widely used assymetric crypto system out there en.wikipedia.org/wiki/RSA_(cryptosystem)
Math.
Joe Alias Ok XD I'm not saying "I can't believe it works", I'm just saying I don't understand it.
palmomki Yeah I just gave you the super super short version.
Joe Alias I had a feeling you meant that.
By the way, ***** the page is a bit too far for me, but I think I can see that the point I didn't understand isn't explained there (or maybe it's just not said explicitly). What I actually didn't understand is how can the two keys be interchangeable without being compromised. (How can it be that the private key decrypts a public encryption and the public key decrypts a private encryption avoiding that the private key is reachable) I would guess that in this case you could somehow obtain the private key by analyzing how both the encryption and decryption with the public key work, because if they can decrypt each other it means that both the public encryption and decryption processes are strictly related to the private key.
In brief, it seems to me that there are actually many data about the private key in the public key itself.
I know this concept long time ago, this is the first time I understand it, thanks so much friend
For this to work for "the masses", we'd need companies like Google, Apple and Microsoft to put their heads together, and provide a universal public key server/service across their respective platforms, and integrate its use into their products.
The problem is, do we trust them enough to handle even the public keys?
You mean like this?
developers.google.com/accounts/docs/OAuth2Login
*****
That's for authentications. I'm thinking more about encryption, and getting that technology into the public sphere. Even with PGP and similar tools, meant to make this easy, it's really only used by the few, because it's not easy, and it requires the recipient to install special software as well.
What if Google, Apple, Microsoft and other providers were tied into the public key services, and would automatically handle for instance authentication of incoming messages, should they have been signed, and in turn help you to generate the private key needed, and get its public key exported to the servers, in a nearly seamless manner.
Asbjørn Grandt you mean, so people could share encrypted and signed files with their friends? So for example if you circle someone on Google+ you get a copy of their public key and you can send files intended for them only?
***** That's not a bad idea. But also if someone sends you a signed message on for instance Gmail, it'll ask if you want to verify it.
I know there are plug-ins (probably) and other email clients can do this. I would just like it to be built in, and active by default.
Most email software support encryption with S/MIME, but for webmail the user needs to install addons.
I'm just glad he called it an oversimplification, as there is quite a lot of maths involved utilizing phi, prime numbers etc. I love how by oversimplifying it, he made the theory behind it very accessible to anyone not even in the field of Computer Science. However once quantum computing comes out, this system may or may not need a replacement. ;)
The beautiful thing about Robert’s explanation is that it simplifies the math, but not so much the core process. There are techniques underlying the protocol, and techniques used on top of the protocol, but those are implementation details that will change over time. The protocol itself is timeless and perfectly expressed here.
Very well explained but I keep on finding it difficult to learn or become and expert trader by watching tutorials here on TH-cam until I was introduced to a licenced investor a great tutor and a mentor ,I must say Sir Brown is nothing but a genius.
Oh that's awesome to know you also let Mr Brown trade for you ...he is such a genius in crypto market ..
I used to make loss trading crypto until I found people talking about the expertise of sir brown when it comes to the crypto market ...meeting sir Brown changed my life ..I no longer have to worry about debts because I invest another so I make huge profit trading with him
Please does anyone have an Idea how I can reach out to sir brown..its urgent ..
OK that's easy..all you need to do is connect with him on LinkedIn as
Sir Obrowne
Man here deserves a big credit and a raise.
You know why so people use it? Because it can cost hundreds of dollars per year! The cheap ones: 100$ for a domain, 300$ for all company domains, 500$ for subdomain of one domain. Dafuck? It's like 1kb of data (public key, private key, company info, domain). This is the expensive storage system on the Internet.
workaround: Put a folder for public keys on an ftp server and just en/decrypt messages yourself (using software like OpenPGP), afterwards, paste the messages whereever you wanna send them to
I'm talking about domain verification (https). Self Signed Certificate triggers on browser "a not secured website".
oh, that's what you mean. Yeah, that stuff sure is expensive
yeah and piss me off really hard too
There's a limited supply of prime numbers (edit: within a given finite range which can be stored on the computer), and a very large demand. That's why it costs money.
This is the best explanation on the internet.
i didnt know that wolverine was a crypto expert when he was young.
Just need your easiest explaination to understand most difficult concepts out there, thank you very much
"obi one" -- welp, now we know who isn't a Star Wars nerd!
I know, right? They didn't even mention Captain Kirk!
Loved it. Finally someone who can understand and also explain.
His hair reminds me of Guy Martin.
+sghost128 If you speed it up to 1.5x, it almost sounds like him too! ;) Only with clear enunciation.
TheVoidReturnsNull And less motorcycles.
thanks mate...i saw about 10 videos to understand this..but cudnt..and then ur video came to the rescue
secrets are for evil doers.
nunya biznez What... Did you read the whole thing and realize there isn't anything you could do but complain about it's length? Or is this another misdirection trick? Are you saying you don't have the mental fortitude to understand and reply appropriately? Do you ever think that maybe anger isn't the driving force in the universe? Why do you feel the need to project your anger issues onto everyone?
Jonathan Jardine
+nunya biznez nice nick. no, you're not trolling at all... OK (for the audience), not just evildoers (even though law enforcement knows their identity *because* they encrypted a message...), but also people installing software, publishing official documents, talking with attorneys, discussing trade secrets over the internet like before software is public, self-defense against terrorists and other criminals, talking with their bank, logging into any sites on the internet, buying anything on the internet, thwarting spies, checking for viruses... the list just goes on & on.
This is the most interesting stuff on Computerphile. Requesting a Cryptography/ Info security video series on this channel (like the postfix-notation stuff) please!
You can talk about Diffie-Hellman key exchange + The maths behind key generation
Data Integrity (checksums)
Authenticity (digital signatures)
Non-repudiation (signatures + public/private keys)
Differences between Identification / Authentication / Authorization and the method that can be used to get them
lives have been changed after this video, thank youuuuuuu!!!
Let me explain this:
1) You give your public key.
2) You decipher static.
3) You find what person can know what it said.
4) That’s the person who sent the message.
In that way, you can move between channels and relocate targets.
Short simple and precise. Thanks Robert for explaining yet so complicated system in a simple way. You have widened my horizon much more than it was 6 minutes ago.