Chapter 8 · Watch, then practise
Network Security
Distinguish secrecy, integrity and authentication, then work a small key-agreement example. The tiny numbers below teach modular arithmetic; they are unsuitable for real cryptographic systems.
3 questions · 3 with related videos. Matches are based on playlist titles; broader background matches are labeled.
What to study
- TLS security properties
- Digital signatures
- Diffie–Hellman arithmetic
Chapter playlists
Choose a playlist
Notes
How do SSL & TLS protect your Data? - Confidentiality, Integrity, Authentication - Practical TLS
Practical Networking · 5:15
Choose a video · 2 lectures
Supplementary TLS security-properties lecture, followed by a TLS 1.3-specific comparison.
1. What TLS protects
Which protections does a correctly established TLS 1.3 channel provide?
It protects application data confidentiality and integrity and supports peer authentication. Certificate validation and endpoint security still matter. TLS does not conceal all traffic metadata, such as packet timing or record lengths, and it cannot make a compromised endpoint trustworthy.
Basics Of Digital Signature Explained in Hindi
5 Minutes Engineering · 8:01
Digital-signature explanation for separating authenticity from confidentiality.
2. Signature versus encryption
A document has a valid digital signature. Is its content necessarily secret?
No. A signature supports integrity and origin authentication with the appropriate trusted verification key; the document may remain readable. Confidentiality requires encryption. A signature alone also does not prevent replay of a previously valid signed message.
Diffie-Hellman Key Exchange - the MAGIC that makes it possible - Cryptography - Practical TLS
Practical Networking · 6:56
Supplementary Diffie–Hellman math explanation; the toy parameters here are calculated in the answer.
3. Worked key agreement
For a toy Diffie–Hellman example, let p = 23, g = 2, Alice’s secret a = 6 and Bob’s secret b = 7. Find public values and the shared secret.
Alice sends A = 2⁶ mod 23 = 18. Bob sends B = 2⁷ mod 23 = 13. Alice computes 13⁶ mod 23 = 6; Bob computes 18⁷ mod 23 = 6. Matching results follow from g^(ab) mod p. Unauthenticated exchange is vulnerable to impersonation; these tiny parameters are educational only.