CSE 505A Data Security

Course Description

In this age of Internet computing, there is indeed no place or time at which security does not matter. Protecting vital data from various attacks is always an important part in data systems. This course provides introduction to both theory and practice of data security. The theory part includes conventional crypto-algorithms, public-key crypto-algorithms, hash functions and digital signatures. The practice part covers important data security tools and applications: Kerberos, SSH, X.509, IP Security, SSL/TLS, and possibly others. This course is self-contained: basic mathematical foundations, e.g., basics of number theory, are covered in the course.

Course Objective

To provide an in-depth coverage of the theory, algorithms, technology and systems for data security.

The course will focus on four components:

• Basic knowledge
• Practice and implementation
• Research skills
• Presentation skills

Lecture Notes , Homework , Project, and Announcements

Text Book

William Stallings, Cryptography and Network Security: Principles and Practice , 3rd Edition, Prentice-Hall, 2003.

Reference Books

Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone , Handbook of Applied Cryptography , CRC Press, 4th Printing, 1999.

Bruce Schneier, Applied Cryptography , Second Edition, John Wiley & Sons, 1996.

Administrative Information

Instructor: Yixin Chen

• Office: Jolley Hall, Room 540
• Email: chen@cse.wustl.edu
• Office Hours: Tuesday and Thursday 5:30 - 6:00pm (after classes); Friday 4-5pm, Jolley Hall 540

TA: Ali Gardezi

• Office: CSE Graders Lounge (Urbauer 114)
• Email: aig1@cec.wustl.edu
• Office Hours: MTu 6:00pm-7:00pm,WTh 1:15pm-2:15pm, F 2:30pm-3:30pm (If these times are inconvenient, send me an email and I will try to schedule a meeting)

Assignments and Grading

There will be four homeworks, one midterm exam, and one final project.
The project requires proposal, system demonstration, presentation, and technical report.

There will be no final exam.

Late homeworks lose 20% of their scores per day (except in cases of illness or emergency), and will not be accepted 3 days after the due date.

Collaboration in terms of discussions is generally allowed and encouraged. It is not allowed to copy other people's solutions.

Activity Weights

• Homework I 10%
• Homework II 10%
• Homework III 10%
• Homework IV 10%
• Midterm Exam 30%
• Final Project 30%

I do not curve.

Course homepage: http://www.cse.wustl.edu/~chen/505A/

Newsgroup: wu.cse.class.505a

It is your responsibility to check out the homepage and newsgroup regularly (at least once every other day) for news and announcements.

Syllabus

• Overview
• Threats and Attacks
• Security Services
  
  
• Principles
• Conventional Algorithms
• Classic Systems
• DES
• Field Theory
• Contemporary Symmetric Ciphers
• Confidentiality using Symmetric Encryption
• Public-Key Algorithms
• Basics of Number Theory
• RSA
• Elliptic Curve Cryptosystem
• Hash Functions
• Massage authentication
• Hash algorithms
• Digital signatures
  
  
• Practices
• Network Security
• Authentication
• Email security
• IP security
• Web Security
• System Security
• Intruders
• Virus
• Firewalls