Notes for January 22, 1997
-
Hello
-
Project comments will be out by Friday
-
Want to post a 1-line description of projects being done; please use
handin to hand it in (or I will summarize what you sent, and may get it
wrong!)
-
Puzzle of the day
-
Key point: real problem, no really good answer; a good project would be
to analyze the options thoroughly, esp. with regard to ethics and
practicality.
-
Authentication
-
validating client (user) identity
-
validating server (system) identity
-
both ("mutual authentication")
- Basis
-
What you know
-
What you have
-
What you are
-
(proposed) Where you are
-
Passwords
How UNIX does selection
-
Problem: common passwords
-
May be pass phrases, etc.; goal is to make search space as large as
possible and password distribution as uniform as possible
-
Go through Morris and Thompson study; augment with Klein, mine, etc.
-
Other ways to force good password selection: random, pronounceable,
computer-aided selection
-
Go through problems, approaches to each, esp. proactive
-
Password Storage
-
In the clear (MULTICS story)
-
Enciphered (key must be on line somewhere; get it and it's all over)
-
Hashed; present idea of one-way functions using identity and sum
-
Show UNIX version
-
Attack Schemes Directed to the Passwords
-
Exhaustive search: UNIX is 1-8 chars, say 96 possibles; it's about 7e16
-
Inspired guessing: think of what people would like (see above)
You can also see this document as a
Binhex Framemaker version 5 document,
Postscript document,
or a
plain ASCII text document.
Send email to
cs153@csif.cs.ucdavis.edu.
Department of Computer Science
University of California at Davis
Davis, CA 95616-8562
Page last modified on 1/22/97