## Connecting on the Internet

### People who liked this video also liked

### Comments

19 comments posted so far. Login to add a comment.

49

Comment rated too low. Show this comment

#### 2. LightAng3l commented 10 years ago

The question is: Is your secret so important that it's worth doing math over?

50

Comment rated too low. Show this comment

#### 4. irishgek commented 10 years ago

Well explained , but in reality no encryption is safe other wise hackers would not exist

37

#### 8. Thanny commented 10 years ago

#4 When you see a "hacker" in a movie or TV show decrypting information, you're seeing fiction, not reality.

Unless it's incredibly weak encryption that can be brute-forced in short order, the only way a "hacker" might get access is to guess the passphrase that generated the key, which itself can be done via social engineering or brute force only for weak passwords.

Solid encryption with a strong password is unbreakable.

Unless it's incredibly weak encryption that can be brute-forced in short order, the only way a "hacker" might get access is to guess the passphrase that generated the key, which itself can be done via social engineering or brute force only for weak passwords.

Solid encryption with a strong password is unbreakable.

32

#### 11. cyberdevil commented 10 years ago

I was going to say this was real easy to understand, but that was before it started getting numerical. Really informative video regardless, enjoyed watch.

46

#### 12. mmmendal commented 10 years ago

The title is wrong. It should say something like Public Key Cryptography.

Here is a more fun explanation:

https://www.youtube.com/watch?v=_f-5aJcRNrU&feature=related

Here is a more fun explanation:

https://www.youtube.com/watch?v=_f-5aJcRNrU&feature=related

37

#### 13. Tarc commented 10 years ago

I think he failed to explain the "mod" function well enough so that it's easier to understand.

"46 mod 12" simply means the REMAINDER of the 46/12 operation, if you take how many times 12 (as a whole) goes into 46. It's three times (36) with 10 remaining.

It's much easier to understand with 10:

"<any number> mod 10" gives you a single digit, the last digit of the original number. This is the remainder of a division by 10.

"46 mod 10" = 6, because 10 goes into 46 four times, with 6 as the remainder.

An interesting example is a "x mod 2" operation.

"<any number> mod 2" results in either 1 or 0.

If it's even, the remainder will be zero, otherwise 1, hence determining whether the number is odd or even

46 mod 2 is 0 because 2 goes into 46 23 times without any remainder.

47 mod 2 is 1 because 2 goes into 47 23 times with a 1 remainder.

The result is always either 1 or 0 and one can quickly check a number's parity with a simple "mod 2" operation :p

"46 mod 12" simply means the REMAINDER of the 46/12 operation, if you take how many times 12 (as a whole) goes into 46. It's three times (36) with 10 remaining.

It's much easier to understand with 10:

"<any number> mod 10" gives you a single digit, the last digit of the original number. This is the remainder of a division by 10.

"46 mod 10" = 6, because 10 goes into 46 four times, with 6 as the remainder.

An interesting example is a "x mod 2" operation.

"<any number> mod 2" results in either 1 or 0.

If it's even, the remainder will be zero, otherwise 1, hence determining whether the number is odd or even

46 mod 2 is 0 because 2 goes into 46 23 times without any remainder.

47 mod 2 is 1 because 2 goes into 47 23 times with a 1 remainder.

The result is always either 1 or 0 and one can quickly check a number's parity with a simple "mod 2" operation :p

54

Comment rated too low. Show this comment

#### 15. loadrunner commented 10 years ago

If a message is really secret, meet in private, tell it, and never write the message down

30

#### 16. utalok commented 10 years ago

#14 that is a special equality for congruence relation.

http://en.wikipedia.org/wiki/Congruence_relation

http://en.wikipedia.org/wiki/Congruence_relation

20

#### 18. glassweaver commented 10 years ago

#2 this is why computer scientists get paid many times more than you to work on computer algorithms. Most people have your same mentality, yet enjoy online banking/facebook/private ims/non-public email.

## +33 1. TrollyAtsam commented 10 years ago