Topics for Final Exam: CMSC 426/626, Fall
2006
Prof. Krishna Sivalingam
Closed Book, Closed Notes Exam.
In-Class Final Exam Date: Dec. 15, 2006, 1.00 - 2.30pm, ACIV 013
Take-Home Questions for the Final Exam will be assigned on
Dec. 14th and due by Dec. 17th, 11PM (online submit)
- Cryptographic algorithms classification and characteristics
(Lecture Notes);
Basic details of DES, DES3, AES,
RC4 (keysize, block size)
Cipher modes: No
need to memorize details of mode operations, but you should what
each mode is used for)
- Basic knowledge of how Diffie-Hellman and RSA algorithms work and
recommended key sizes (need not memorize key generation steps)
- Key Distribution Mechanisms
- Message Authentication and Hash Functions, HMAC
- Digital Signatures: Basics, as presented during lectures
- Authentication Mechanisms: Password based, One-time passwords,
and Kerberos.
- Sections 5.1 - Section 5.3 of Pfleeger & Pfleeger's book.
- Sections 3.1, 3.2 and 3.3 of Pfleeger & Pfleeger's book
- Chapter 19 of Matt Bishop's Book (Intro to Computer Security): A copy
is available in the Library Reserves.
- Class Notes on C/C++ Secure Programming including Buffer Overflow
and (topics covered through and including Nov. 20, 2006).
- Material on Java security covered from pages 1-9 of: http://www.phptr.com/articles/printerfriendly.asp?p=433382&rl=1,
Sample Chapter from Java 2 Platform Security, 2006, Ramesh Nagappan,
Ray Lai, Christopher Steel. Sample Chapter is provided courtesy of
Prentice Hall PTR.
- Material on Security in Voting Systems presented by Rick Carback
on Nov 29th; Details of Punchscan voting systems are NOT needed; Rick's Presentation.
Questions? Please send mail to krishna@cs.umbc.edu