| |
| | CS 321 Lecture Notes (Site not responding. Last check: 2007-10-18) |
 | | Caeser's cyper, or any similar ``substitution cypher'' is painfully insecure- if you can work out one letter (e.g., based on formatting, frequency analysis, or just repetition), you can recognize it anytime that letter appears again. |
 | | Useful examples of symmetric cyphers are the older DES (56-bit key, 64-bits of data at a time), and the more modern AES (128-bit to 256-bit key, 128 bits at a time). |
 | | Both of these are ``block cyphers'', where they take the input one block (64 or 128 bits) at a time, mix it up thoroughly, spit it out, keep the mixed copy, and move to the next block. |
| lawlor.cs.uaf.edu /2005/cs321/lecture/2005_04_27/lecture/lecture.html (666 words) |
|