Author: Matt Bishop Given at: UC Davis Date: February 3, 2016 |
First slide (slide 1) Last slide (slide 36) PDF version |

Slide 1: Lecture for February 3, 2016

Slide 2: Public Key Cryptography

Slide 3: Requirements

Slide 4: RSA

Slide 5: Background

Slide 6: Algorithm

Slide 7: Example: Confidentiality

Slide 8: Example

Slide 9: Example: Integrity/Authentication

Slide 10: Example

Slide 11: Example: Both

Slide 12: Security Services

Slide 13: More Security Services

Slide 14: Warnings

Slide 15: Elliptic Curve Ciphers

Slide 16: Addition on the Curve

Slide 17: Mathematically

Slide 18: A Hard Problem

Slide 19: Elliptic Curve Cryptosystem

Slide 20: ECC Version of Diffie-Hellman

Slide 21: Communication

Slide 22: About the Curves

Slide 23: Cryptographic Checksums

Slide 24: Example Use

Slide 25: Definition

Slide 26: Collisions

Slide 27: Keys

Slide 28: HMAC

Slide 29: Handling Keys

Slide 30: Notation

Slide 31: Session, Interchange Keys

Slide 32: Benefits

Slide 33: Key Exchange Algorithms

Slide 34: Classical Key Exchange

Slide 35: Simple Protocol

Slide 36: Problems

Slide 2: Public Key Cryptography

Slide 3: Requirements

Slide 4: RSA

Slide 5: Background

Slide 6: Algorithm

Slide 7: Example: Confidentiality

Slide 8: Example

Slide 9: Example: Integrity/Authentication

Slide 10: Example

Slide 11: Example: Both

Slide 12: Security Services

Slide 13: More Security Services

Slide 14: Warnings

Slide 15: Elliptic Curve Ciphers

Slide 16: Addition on the Curve

Slide 17: Mathematically

Slide 18: A Hard Problem

Slide 19: Elliptic Curve Cryptosystem

Slide 20: ECC Version of Diffie-Hellman

Slide 21: Communication

Slide 22: About the Curves

Slide 23: Cryptographic Checksums

Slide 24: Example Use

Slide 25: Definition

Slide 26: Collisions

Slide 27: Keys

Slide 28: HMAC

Slide 29: Handling Keys

Slide 30: Notation

Slide 31: Session, Interchange Keys

Slide 32: Benefits

Slide 33: Key Exchange Algorithms

Slide 34: Classical Key Exchange

Slide 35: Simple Protocol

Slide 36: Problems