Kris Gaj Research and teaching interests: ECE 646 Cryptography and Computer Network Security. Course web page: Contact: ECE 646

Transcription

1 646 and Computer Network Security Course web page: web page Courses 646 Kris Gaj Research and teaching interests: cryptography network security computer arithmetic FPGA & ASIC design and testing Contact: The Engineering Building, room 3225 Office hours: Tuesday, 6:00-7:00 PM Thursday, 7:30-8:30 PM MS CpE: NETWORK D SYSTEM SECURITY Advisors: Kris Gaj, Jens-Peter Kaps, Kai Zeng. 542 Computer Network Architectures and Protocols S.-C. Chang, et al and Computer Network Security K. Gaj, J.-P. Kaps lab, project Advanced Applied J.P. Kaps, K. Gaj lab, project 4. ISA 656 Network Security R. Simon, A. Stavrou, D. McCoy Cryptographic Engineering J.-P. Kaps MS CpE: COMPUTER NETWORKS Advisors: Brian Mark, Bijan Jabbari, S.C. Chang. 528 Introduction to Random Processes in Computer Network Architectures and Protocols Design and Analysis of Comp. Networks and Computer Network Security Wireless Networks High-Speed Networks MS EE: COMMUNICATIONS D NETWORKING security & applications performance network link physical Comp. Network Operating Systems Architectures CpE and Protocols CS 57 core Wireless Design & Analysis Networks of Networks EE core 542 CpE core Optoelectronics Wireless & Networks 630 Statistical comm theory 528 EE core Theory Random Processes 633 Coding Theory High-Speed Networks Digital Mobile Network Security CS 672 CS 756 Performance Analysis & Evaluation 737 Spread Spectrum 739 Satellite Lecture Homework 0 % Midterm exam 20 % Final Exam 25 % 646 Laboratory 0 % Project 35 % Specification - 5 % Results - 0 % Oral presentation - 0% Written report - 8% Review - 2%

2 Bonus Points for Class Activity Based on class exercises during lecture Small points earned each week posted on BlackBoard Up to 5 big bonus points Scaled based on the performance of the best student deapth For example:. Alice 2. Bob 28. Charlie Small points Big points Lecture viewgraphs / whiteboard viewgraphs available on the web (please, extend with your notes) books required (Stallings) optional (all chapters available on the book web page) articles (CryptoBytes, RSA Data Security Conf., CHES, CRYPTO, etc.) Homework optional assignments short programs vs. analytical problems or HDL codes ü More time consuming ü Most time spent on debugging ü Relatively straightforward ü Typically less time consuming ü More thinking ü Little writing web sites - Crypto Resources standards, FAQs, surveys Midterm exam Getting Help Outside of Office Hours ü 2 hours 40 minutes System for asking questions 24/7 ü multiple choice test + short problems Answers can be given by students and instructors ü open-books, open-notes Student answers endorsed (or corrected) by instructors Average response time in Fall 203 =. hour You can submit your questions anonymously You can ask private questions visible only to ü practice exams (with solutions) available on the web Tentative date: Tuesday, October 28th the instructors 2

3 Final exam 2 hours 45 minutes Multiple choice + several problems Tuesday, December 6 7:30 0:5 PM Laboratory labs based on two major software packages ü CrypTool ü GnuPG for Windows or GnuPG for Linux done at home or in the labs: software downloaded from the web based on detailed instructions grading based on written reports (answers to questions included in the instructions) original Project () useful Mixed Projects depth, originality based on additional literature you can start at the point where former students ended based on something you know and are interested in software, hardware, analytical, or mixed may involve experiments teams of -3 students 20% 20% 80% 60% Project (2) about three weeks to choose a topic and write the corresponding specification regular meetings with the instructor a few oral progress reports based on Power Point slides draft final presentation due at the last progress report short conference-style oral presentations contest for the best presentation written report/article, IEEE style publication of reports and viewgraphs on the web Project (3) Project reports/articles requirements - IEEE style - 5 pages maximum - appendices possible but do not influence the evaluation Review of project reports - initial version of the report due Saturday, Dec. 6 - reviews done by your colleagues - reviews due, Thursday, Dec. - final version of the report due Saturday, Dec. 3 3

4 Project (4) Project presentations Tuesday, December 9, 5:00-0:00PM - conference style - open to general public (in particular, students from previous years), seminar credit - 0 minutes for the presentation + 5 minutes for Q&A - time strictly enforced - audience votes in the contest for the best project Contest for the best project Two independent categories: Results Presentation Scale: 0 = very poor to 0 = excellent Results Original & Correct analysis implementation & testing scheme Meeting Project goals Efficiency & security of the proposed/selected design/scheme Useful for other students & other members of the cryptographic community Presentation Motivation & background Clear and Concise presentation of main results Logical organization of the talk Quality of viewgraphs Answering questions Discussion of encountered problems Conclusions Awards (separate in each category) Types of Projects Typically Winning the Contest Fall 203 Fall 202 I award - 5 points II award - 3 points III award - point Fall Fall 200-4

5 Combining Projects from Two Different Courses Typical course 646 & 545 difficulty 545 project: Hardware implementation of authenticated ciphers competing in the CAESAR contest 545 project can be extended into an 646 project by adding additional ciphers, architectures, key sizes, modes of operation, etc. difficulty This course time 646 & 797/798/799/ project can be extended into a Scholarly Paper, Research Project, Master s Thesis, PhD Thesis time Follow-up courses and Computer Network Security 646 Advanced Applied Digital System 746 Design with VHDL 545 Computer Arithmetic 645 Cryptographic Engineering 899 and Computer Network Security Advanced Applied Modular integer arithmetic Operations in the Galois Fields GF(2 n ) Historical ciphers Classical encryption (DES, AES, cipher modes) Public key encryption (RSA, Diffie-Hellman) Hash functions and MACs Digital signatures Public key certificates Secure Internet Protocols - PGP and S-MIME - www: SSL/TLS Cryptographic standards AES Stream ciphers Elliptic curve cryptosystems Random number generators Smart cards Attacks against implementations (timing, power, fault analysis) Efficient and secure implementations of cryptography Security in various kinds of networks (IPSec, wireless) Zero-knowledge identification schemes 5