CS 491/591-10 Tuesday, January 20 Initial topic: A Survey of Basic Cryptography

1/20/98


Click here to start


Table of Contents

CS 491/591-10 Tuesday, January 20 Initial topic: A Survey of Basic Cryptography

What is cryptology?

An Important Distinction

Cryptographic work can be at different levels

Some applications of cryptography

Open system design vs closed system design

Types of Security

Types of algorithms Symmetric (encryption)

PPT Slide

PPT Slide

PPT Slide

Digital Signatures

Why Public Key is so important

Math Background Modular (clock) Arithmetic

Encryption Algorithms Historical and Toy

Generalizations of Caesar Cipher (all weak security)

Other Historial Ciphers

Unconditionally Secure Cipher One-time pad

Data Encryption Standard (DES) (symmetric key)

Extensions to DES that may give a longer effective key

RC5 by Ron Rivest of RSA (symmetric encryption algorithm)

RSA (public key encryption*)

RSA (public key encryption, continued)

Hash functions H

Authentication unconditionally secure

PPT Slide

Efficiency Considerations and the need for symmetric session keys

Key Exchange: Establishing a (symmetric) Session Key k

PPT Slide

PPT Slide

Open Network

PPT Slide

VPN software/hardware

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

PPT Slide

Fortezza, Capstone, and Skipjack

PPT Slide

PPT Slide

Homework

Block Ciphers

Modes of DES Encryption

Electronic Code Book mode (ECB)

PPT Slide

Attacks -- characterized by needs of the attacker

The birthday paradox

A birthday attack

Meet in the middle attack on symmetric encryption functions (known plain text attack)

Meet in the middle technique

Homework 2

Using CBC DES for authentication (symmetric)

PPT Slide

PPT Slide

The Digital Signature Algorithm DSA/DSS set-up

PPT Slide

PPT Slide

Primality Testing

Strong primes p

Elliptic Curve Algorithms public key encryption/authentication

Factoring Techniques

Pseudo-random number generators

Stream Ciphers (example -- binary cipher)

Zero-knowledge proofs (crypto tools)

Zero knowledge proofs are simulateable (conversation distributions are indistinguishable)

Complexity Theory

Quantum Computation

More Notation

Some security partners for crypto (Crypto can not solve all security problems)

3rd Homework

Extra questions

Author: Peter Gemmell

Email: gemmell@cs.unm.edu

Home Page: http://www.cs.unm.edu/~gemmell