IT 531

Catalog Data: (3:2:3) W Prerequisite: CS 235, Math 112; or equivalents.
Analyzing theory, algorithms, and implementations for digital data encryption and compression. Common standards scrutinized. Lab emphasizing implementation.

Textbook(s):

• Cryptography and Network Security, 3 rd ed., by William Stallings

• A Guide to Data Compression Methods, by David Salomon

Reference Book(s):

• Various papers and websites

Class website: Contact instructor

Class Coordinator: Michael Bailey

Goals: To understand the technologies underlying modern digital lossless compression and encryption standards.

Prerequisites by topic:

• Elementary calculus

• High-level language computer programming, including:

  • Data structures
  • Analysis of algorithms

Outcomes

1. Define and give examples of dictionary compression methods
2. Define and give examples of run-length encoding
3. Define and give examples of statistical compression
4. Show how the various lossless compression techniques are used in modern digital standards
5. Explain the relationship of information theory to compression and encryption
6. Compare the techniques, benefits and risks of symmetric encryption standards such as DES and AES
7. Compare and contrast how symmetric and public-key cryptosystems are used
8. Describe common errors in cryptographic implementations
9. Understand cryptography in the broader social context, including legally and ethically

Laboratory projects: Labs for this class are open; after an introduction by the lab instructor, students may complete that lab at their own pace and schedule. Time is also allowed for a substantial team research project of students’ choosing.

Laboratory topics (topics do not necessarily correspond to individual lab exercises):

1. Huffman coding
2. One-time pads
3. Steganography
4. Symmetric cipher
5. Cipher analysis
6. Public-key encryption

Laboratory Equipment: Computers must run under Windows OS, with CADEM access for Matlab, C and Java.

Written and oral communication requirements: The course requires the students to prepare and present a related research project. The presentation includes both oral and written portions.

Math Analysis: Finite fields, abstract algebra, modulo arithmetic

Library or other Research Projects:

Life-long learning experiences: (See “Written and oral communication requirements” above.)

Prepared By: Michael Bailey

Date Revised: 31 May 2005