Notes for October 25, 1999
- Greetings and Felicitations!
- Bibliography: I'll have copies made for Monday or Wednesday of next
week
- Program hints: see newsgroup. Should I extend homework due date to
Wednesday?
- Puzzle of the Day
- Specification Detection
- Look for violations of specifications
- Basis: need a representation of specifications
- Issues: similar to misuse detection
- Advantage: can detect attacks you don't know about.
- Cryptography
- Ciphers v. Codes
- Attacks: ciphertext-only, known plaintext, known ciphertext
- Classical
- monoalphabetic (simple substitution):
f(a) = (a + k) mod n
- example: Cæsar with k = 3, RENAISSANCE -> UHQDLVVDQFH
- polyalphabetic: Vigenère,
fi(a) = (a + ki)
mod n
- cryptanalysis: first do index of coincidence to see if it's
monoalphabetic or polyalphabetic, then Kasiski method.
- problem: eliminate periodicity of key
- Long key generation
- Running-key cipher: M=THETREASUREISBURIED; K=THESECONDCIPHERISAN;
C=MOILVGOFXTMXZFLZAEQ; wedge is that (plaintext,key) letter pairs are
not random (T/T, H/H, E/E, T/S, R/E, A/O, S/N, etc.)
- Enigma/rotor systems; wheels, 3 rotors and a reflecting one. Go
through it; UNIX uses this for crypt(1) command.
- Perfect secrecy: when the probability of computing the plaintext
message is the same whether or not you have the ciphertext
- Only cipher with perfect secrecy: one-time pads; C=AZPR; is that
DOIT or DONT?
- DES
- Go through the algorithm
- Public-Key Cryptography
- Basic idea: 2 keys, one private, one public
- Cryptosystem must satisfy:
- given public key, CI to get private key;
- cipher withstands chosen plaintext attack;
- encryption, decryption computationally feasible [note: commutativity
not required]
- Benefits: can give confidentiality or authentiction or both
- Use of PKC
- Normally used as key interchange system to exchange secret keys
(cheap)
- Then use secret key system (too expensive to use PKC for this)
Send email to
[email protected].
Department of Computer Science
University of California at Davis
Davis, CA 95616-8562
Page last modified on 10/25/99