Notes for January 15, 1997

  1. Hello
      Would it help to put out code for using getpwnam and getgrent? Gene will discuss this program in section, too
  2. Puzzle of the day
    1. No right answer, but there are better places to look than others. I'll ask this one periodically to see how your knowledge is changing.
    Breaking UNIX crypt(1)
      Purely statistical attack is possible (me) but it takes gobs of ciphertex
    1. Known plaintext attack: that's Reeds and Weinberger's attack, with a nice suggestion by Bob Morris
  3. Public-Key Cryptography
    1. Basic idea: 2 keys, one private, one public
    2. Cryptosystem must satisfy: (a), given public key, CI to get private key; (b) cipher withstands chosen plaintext attack; (c) encryption, decryption computationally feasible [note: commutativity NOT required]
    3. Benefits: can give confidentiality or authentiction or both

You can also see this document as a Binhex Framemaker version 5 document, Postscript document, or a plain ASCII text document.
Send email to

Department of Computer Science
University of California at Davis
Davis, CA 95616-8562

Page last modified on 1/23/97