Lecture #33
- Announce
- Begin Reading Chapter 10 on Operating Systems
Computer Security
- Cypher Reuse
- The Magic Encoder Ring?
- One Time Pads
- Can be Absolutely Secure
- Computers and Random Number Generators
- The Key Exchange Problem
- Threats
- Using your "secure" channel
- A Padlock Analogy
- Whitfield Diffie, Martin Hellman, and Ralph Merkle solution
- Public Key Encryption
- Traditional Cyphers
- A Padlock Analogy
- Diffie Proposal in 1975
- Non-Commutativity of Standard Methods
- Failure of Commutative Methods
- Rivest, Shamir, and Adleman (RSA) Encryption
- Overview of Use
- Using Public Key and Private Key
- Primes and Factoring
- Examples of Primes
- How to Factor into Primes
- Hard
- The Remainder Operator %
- Usually called modulus
- "Wrap Around" Property
- Clock or Odometer Analogy
- Going Through the RSA Example
- Breaking the Code
- Digital Signatures
- Using Private Key and Public Key
- PGP -- Zimmerman
- Other Attacks (Buzz Words)
- Many Leave No Trace
- Password Hacking
- IP Spoofing
- Replay Attack
- Main in the Middle
- Denial of Service
- Whom Can You Trust?
- Viruses
- Trapdoors
- Common Sense
- The Strong Encryption Trap
- Lose the Key: the Data is GONE!