| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Time: | Tuesday/Thursday 5:00 - 6:15 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Place: | THN E316 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Instructor: |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Assistant: |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Web Page | http://www.cs.virginia.edu/~cs416/ | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Prerequisites: | CS 201, CS 202, Basic linear algebra, geometry, and calculus - CS 216 suggested In previous years, the only prereq was CS 201 and CS 202. I'm strongly suggesting that students have completed CS 216 as well because programming is required for this course. Data structures (pointers, lists, and memory allocation) will be used extensively. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Textbooks: | Artificial Intelligence, A Modern Approach, Russell and Norvig (2nd Edition) | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Assignments: | There will be three or four programming assignments in this course. All assignments must be written in C or C++. The program source code will be read. Source code documentation and organization should make your programs easy to read and convey your understanding of the implemented functions. Poor documentation and programming style will result in a lower score. More detailed instructions regarding required documentation will be provided with each assignment. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Homeworks: | Three (perhaps four) programming assignments and a couple written assignments | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Tests: | One midterm and one final | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Grading: | Programs (40%) + Tests (25% and 25%) + Homework (10%) View Gradebook | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Late Days: | Students have five late days that they can use in any way during the semester. Each late day extends the due date 24 hours. Use your late days wisely; you will not be granted additional late days without a written note from the Dean's office. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Honor Code: | The honor code applies to all work turned in for this course. In particular, all code and documentation should be entirely your own work. You may consult with other students about high-level design strategies related to programming assignments, but you many not copy code or use the structure or organization of another students program. Said another way, you may talk with one another about your programs, but you cannot ever look at another student's code nor let another student look at your own code. Each assignment will include a specific Honor Code Guideline referring to the use of online materials. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Lectures: | The following topics will be presented during the semesters lectures. This is only a rough outline of the schedule and entire topics may be added or removed. The class web page will document the lecture schedule and provide access to the slides used for each lecture. Consult it often. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Thursday, 17 November 2011
logic
toc
Tentative Schedule
Monday, 14 November 2011
graph theory
graph theory
Graph Theory Lecture Notes
- Introduction
- Definitions and Examples
- Eulerian Graphs
- Hamiltonian Graphs
- Graph Connectivity
- Tree Graphs
- Graph Planarity
- Graph Embedding
- Graph Coloring
Thursday, 13 October 2011
CRYPTOGRAPHY BY STALLING PPT
CRYPTOGRAPHY BY STALLING PPT
Course Materials
Schedule
Always, always subject to change| Date | Topic | Readings | Handouts & Links | Assignments/Notes |
|---|---|---|---|---|
| 1/29 | Introduction, Network & Security Concepts | Text: 2.1, 2.2 (Be familiar with the material in Ch. 1) | Syllabus, Textbook Website | Read the Integrity Statement |
| 1/31 | Network & Security Concepts | Text: 2.3-2.7 | Slides (Ch. 1) | Please fill out this form and indicate 3 preferences for your course project. |
| 2/5 | Classical Encryption Techniques | Text: None | Slides (Ch. 2) | |
| 2/7 | Classical Encryption Techniques (cont.) | Text: None | Slides (Ch. 2) | HW 1 Assigned |
| 2/12 | Classical Encryption Techniques (cont.), Modern Block Ciphers | Text: 3.1, 3.2, ignore "Rotor" machine cipher material from Ch. 2 | Slides (Ch. 2) Slides (Ch. 3) | Classroom changes to ITE 237 on 2/14 |
| 2/14 | Snow Day | |||
| 2/19 | Modern Block Ciphers (cont.) | Text: 3.3, 3.4 | Slides (Ch. 3) | HW 1 Due, HW 2 Assigned |
| 2/21 | Modern Block Ciphers (cont.) | Text: None. | Slides (Ch. 3) The Data Encryption Standard (DES) and its strength against attacks | |
| 2/26 | More on Symmetric Ciphers | Text: 6.1, 6.2 | Slides (Ch. 6) | HW 2 Due |
| 2/28 | More on Symmetric Ciphers (cont.) Confidentiality Using Symmetric Encryption | Text: 6.3, 6.4, 7.1 | Slides (Ch. 6) Slides (Ch. 7) | HW 3 Assigned |
| 3/5 | Confidentiality Using Symmetric Encryption (cont.) | Text: 7.2, 7.3 | Slides (Ch. 7) | |
| 3/7 | Confidentiality Using Symmetric Encryption (cont.) | Text: 7.4 | Slides (Ch. 7) | HW 3 Due |
| 3/12 | Confidentiality Using Symmetric Encryption (cont.) | Slides (Ch. 7) | ||
| 3/14 | Midterm Exam I | Ch. 1-3, 6-7 | ||
| 3/19 | Spring Break | |||
| 3/21 | ||||
| 3/26 | Introduction to Number Theory | Text: 8.1, 8.2 | Slides (Ch. 8) | |
| 3/28 | Introduction to Number Theory (cont.) and Public Key Cryptography | Text: 8.3, 9.1 | Slides (Ch. 8) Slides (Ch. 9) Twenty Years of Attacks on RSA - Read Timing Attacks | HW 4 Assigned |
| 4/2 | Public Key Cryptography (cont.) | Text: 9.2, 9.3 RFC2410 | Slides (Ch. 9) | |
| 4/4 | Kerberos, X.500, PKI | Text: 14.1, 14.2, 14.3 | Slides (Ch. 14) | HW 4 Due, HW 5 Assigned |
| 4/9 | Key Management and Authentication | Text: 10.1, 10.2, 11.1, 11.2 | Slides (Ch. 10) Slides (Ch. 11) | |
| 4/11 | Message Authentication and Hash Functions (cont.) | Text: 11.3, 11.4, 11.5 | Slides (Ch. 11) | HW 5 Due, HW 6 Assigned |
| 4/16 | School Cancelled - Power Outage | |||
| 4/18 | Exam II | HW 6 Due | ||
| 4/23 | Hash and Mac Algorithms | Text: 12.1-12.4 | Slides (Ch. 12) | |
| 4/25 | Digital Signatures and E-mail Security | 13.1-13.3, 15.1, 15.2 | Slides (Ch. 13) | HW7 Assigned |
| 4/30 | IPSec | |||
| 5/2 | Talk by William Newton | HRU Paper William's Slides and cited Papers | HW7 Due, Talk Summary for Will | |
| 5/7 | Web Security | Text: 16.1-16.3, 17.1-17.3 | Slides (Ch. 17) | Talk summary is due Final Exam Chapters: 12-20 |
| 5/9 | Talks: Lee and Shantanu | Slides for Lee Slides for Shantanu | Summaries for talks | |
| 5/14 | Final Exam Review | talk summaries for Lee and Shantanu | ||
| 5/21 | Final Exam | Time: 3:30-5:30 Chapters: 12-20 | Full Final Exam Schedule | Good Luck! Have a good semester. |
CRYPTOGRAPHY AND SECURITY PPT
CRYPTOGRAPHY AND SECURITY PPT
Instructor: Pro.Dick Steflik
SYLLABUS:
Historic background of network security; legal, social and ethical implications associated with network security. Emphasis will be on understanding and identifying hazards and the mitigation of the associated risks. Investigation and analysis of classical attacks. Machine and OS hardening. Additional topics will include: cryptography, perimeter defenses, firewalls, virtual private networks, remote network access and demilitarized zones
References:
Core Java; Addison-Wesley
The Java Application Programming Interface; Gosling, Yellin & Java Team; Addison Wesley
PPT SLIDE:
Instructor: Pro.Dick Steflik
SYLLABUS:
Historic background of network security; legal, social and ethical implications associated with network security. Emphasis will be on understanding and identifying hazards and the mitigation of the associated risks. Investigation and analysis of classical attacks. Machine and OS hardening. Additional topics will include: cryptography, perimeter defenses, firewalls, virtual private networks, remote network access and demilitarized zones
| Text: |
| Required - Network Security Essentials (2nd Edition, ISBN 0-13-035128-8) by William Stallings |
| Assigned Internet Reading Assignments |
Core Java; Addison-Wesley
The Java Application Programming Interface; Gosling, Yellin & Java Team; Addison Wesley
PPT SLIDE:
Friday, 7 October 2011
INTRODUCTION TO SOFTWARE ENGINEERING PPT
INTRODUCTION TO SOFTWARE ENGINEERING PPT
JINSTRUCTOR: Allison Elliott TewKNJ
Software Engineering: A Practitioner's Approach
Author: Roger S. Pressman Publication Information: Fourth Edition, McGraw-Hill, 1997
The Mythical Man-Month: Essays on Software Engineering
Author: Frederick P. Brooks Publication Information: 20th Anniversary Edition, Addison-Wesley, 1995
JINSTRUCTOR: Allison Elliott TewKNJ
| Topic | Readings | Prepared Lecture | Deliverable | |
| Course Overview Introduction to Software Engineering | · Pressman - 1 & 2 · Brooks - 1 | | ||
| Project Planning Project Introduction & Team Organization | · Pressman - 3 & 5 · Brooks - 2, 3, & 7 | | | |
| Software Lifecycle Software Process Models | · Pressman - 4 · Brooks - 16 & 17 | |||
| Requirements Engineering | · Pressman - 10 & 11 · Brooks - 10 & 15 | | ||
| Requirements Analysis: Structured Techniques | · Pressman - 12 | | ||
| Requirments Analysis: Object-Oriented Techniques | · Pressman - 19 & 20 | |||
| | | | | |
| Modeling Case Study Review for Midterm | | | | |
| | | | | |
| Mental Health Day SRS Question & Answer Session | | | | |
| Software Design Concepts | · Pressman - 13 | | ||
| Project Work Day | | | | |
| Design Review Q & A Software Architecture | · Brooks - 4 | |||
| | | |||
| | | | ||
| Design Review Relflections Design Document Q & A Return SRS | | | | |
| Structured Design Techniques Object-Oriented Design | · Pressman - 14 · Brooks - 11 · Pressman - 21 | |||
| | | | | |
| Implementation & Prototyping Testing & Maintenance | · Brooks - 13 · Pressman - 16, 17, & 22 | | ||
| TheMythical Man-Month Discussion Course Wrap-Up | · Brooks - 19 | | | |
| | | | | |
| | | | | |
| Project Demos | | | | Prototype |
| | | | | |
Subscribe to:
Posts (Atom)