Kris Gaj ECE 646 Research and teaching interests: …Networks ECE 741 High-Speed Networks ECE 742 ECE 731 Digital ECE 737 Satellite Comm. 739 Spread Spectrum Comm. ECE 732 Mobile CS

1

Course web page:

ECE 646Cryptography

and Computer Network Security

Google “Kris Gaj”® ECE 646

Kris Gaj

Office hours: Tuesday, 6:00-7:00 PMThursday, 3:15-4:15 PMand by appointment

Research and teaching interests:• cryptography• network security• computer arithmetic• FPGA & ASIC design and testing

Contact:The Engineering Building, room 3225 [email protected]

ECE 646Part of:

MS in Electrical Engineering

MS in Computer Engineering

Network and System SecurityComputer Networks

Fundamental course for the specialization areas:

Elective course in the remaining specialization areas

Fundamental course for the specialization area:Communications and Networking

Elective course in the remaining specialization areas

ECE 646

Part of:MS in Information Security and Assurance

Elective course for the concentrations:Network and System SecurityApplied Cyber Security

PhD in Electrical and Computer Engineering

PhD in Computer Science

PhD in Information Technology

MS CpE: NETWORK AND SYSTEM SECURITY

Advisors: Kris Gaj, Jens-Peter Kaps, Kai Zeng

1. ECE 542 Computer Network Architectures and Protocols– S. Yun, et al.

2. ECE 646 Cryptography and Computer Network Security– K. Gaj, J.-P. Kaps – lab, project

3. ECE 746 Advanced Applied Cryptography– J.-P. Kaps, K. Gaj – lab, project

4. ISA 656 Network Security– X. Wang, R. Simon

5. ECE 747 Cryptographic Engineering– J.-P. Kaps – project

MS CpE: COMPUTER NETWORKSAdvisors: Brian Mark, Bijan Jabbari, Peter Paris, Zhi Tian

1. ECE 528 Introduction to Random Processes in ECE– Y. Ephraim, Z. Tian, et al.

2. ECE 542 Computer Network Architectures and Protocols– S. Yun, et al.

3. ECE 642 Design and Analysis of Comp. Comm. Networks– B. Jabbari

4. ECE 646 Cryptography and Computer Network Security– K. Gaj, J.-P. Kaps – lab, project

5. ECE 741 Wireless Networks– B. Jabbari

6. ECE 742 High-Speed Networks– B. Mark

2

security & applications

performance

network

link

physical

comm theory

Network SecurityComp. Network

Architectures and Protocols

Wireless Comm.& Networks

ECE542

ECE 531

ECE630

Statistical Comm.Theory

ECE642

ECE 646

ECE 528

Random Processes

Design & Analysis of Comm. Networks

ECE633

Coding Theory

ECE565

Optoelectronics

ECE 746CS 672CS 756

PerformanceAnalysis &Evaluation

WirelessNetworks

ECE741

High-SpeedNetworks

ECE742

ECE731

DigitalComm.

ECE737

SatelliteComm.

ECE739

SpreadSpectrum

Comm.

ECE732

MobileComm.

CS 571Operating Systems

CpEcore

CpEcore

EE core

EE core

MS EE: COMMUNICATIONS AND NETWORKING A few words about You

10 MS ISA

8 MS CpE

4 MS EE

3 PhD ECE1 PhD CS

1 PhD IT2 Non-degree

ECE 646

Lecture ProjectLaboratory

35 %10 %Homework

10 %Midterm exam

20 %Final Exam

25 %

Specification - 5 %Results - 10 %Oral presentation - 10%Written report - 8%Review - 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

For example:

1. Alice 40 5 2. Bob 36 4.5

… … …29. Charlie 8 1

Small points Big points

deapth

• viewgraphs / whiteboard

• viewgraphs available on the web(please, extend with your notes)

• books1 required (Stallings)2 optional (all chapters available on the book web page)

• articles (PQCrypto, CHES, CRYPTO, EUROCRYPT, etc.)

• web sites - Crypto Resourcesstandards, FAQs, MOOCs, conferences,open source software, research groups

Lecture

3

Homework

• optional assignmentsshort programs vs. analytical problemsor HDL codes

ü More time consumingü Most time spent

on debuggingü Relatively straightforward

ü Typically less time consuming

ü More thinkingü Little writing

Getting Help Outside of Office Hours

• System for asking questions 24/7

• Answers can be given by students and instructors

• Student answers endorsed (or corrected) by instructors

• Average response time in Fall 2015 = 41 minutes

• You can submit your questions anonymously

• You can ask private questions visible only to

the instructors

Midterm exam

ü 2 hours 40 minutes

ümultiple choice test + short problems

ü open-books, open-notes

ü practice exams (with solutions) available on the web

Tuesday, October 31

Tentative date:

Final exam

2 hours 45 minutes

Multiple choice + several problems

Tuesday, December 19

7:30 – 10:15 PM

• labs based on two major software packagesü CrypToolü GnuPG for Windows, Linux, or Mac

• done at home or in the ECE labs:software downloaded from the web

• based on detailed instructions

• grading based on written reports (answers to questions included in the instructions)

Laboratory

• 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 1-3 students

Project (1)• original • useful

4

Mixed Projects

HW80%

AN20% HW

40%SW40%

AN20%

AN60%

SW40%

• 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 (2)

• Project reports/articles requirements- IEEE style- 15 pages maximum- appendices possible but do not influence

the evaluation• Review of project reports

- initial version of the report due Sunday, Dec. 10- reviews done by your colleagues- reviews due, Thursday, Dec. 14- final version of the report due Saturday, Dec. 16

Project (3)

• Project presentationsTuesday, December 5, 4:30-9:30PM

- conference style- open to general public (in particular,

students from previous years)- 10 minutes for the presentation + 5 minutes for Q&A- time strictly enforced- audience votes in the contest for the best project

Project (4)

Contest for the best project

Two independent categories:

Results Presentation

Scale:0 = very poor to 10 = excellent

Results

• analysis• implementation

& testing scheme

Original & Correct

Efficiency & securityof the

proposed/selecteddesign/scheme

MeetingProject goals

Usefulfor other students

& other members of thecryptographic community

5

Presentation

Logicalorganizationof the talk

Motivation &background

Clearand Concisepresentation

of main results

Conclusions

Discussionof encountered

problems

Answeringquestions

Qualityof viewgraphs

Awards(separate in each category)

I award - 5 pointsII award - 3 points

III award - 1 point

• Two or more alternative solutions to a certain problem.• Clear evaluation criteria, and their relative importance.• Evaluation of all investigated solutions according to these

criteria. Sometimes, there is a clear winner. In other cases, the winner depends on a particular application scenario.

• Mutual dependencies among various evaluation criteria.• Critical analysis of previous literature, looking for any

mistakes, inconsistencies, missing assumptions, or other flaws of previous work.

• Any remaining imperfections/disadvantages of the best currently available solution, and suggestions for possible improvements.

Typical Approach to an Analytical Project Types of Projects Typically Winning the Contest

Fall 2013 Fall 2012

Fall 2011

SWHW

AN12 3

HWSW-AN

HW-AN12 3

HWAN

HW12 3

Fall 2010HW

ANHW-SW12 3

Winners of the Contest in Fall 2014 & Fall 2015

12 3

HW

HW

HW

12 3

HW

SW

HW

Fall 2014

Fall 2015

Combining Projects from Two Different Courses

• ECE 646 & ECE 545

• ECE 545 project: Hardware implementation of Post-Quantum Cryptographic Algorithms

• ECE 545 project can be extended into an ECE 646 projectby adding additional ciphers, architectures, key sizes,modes of operation, etc.

• ECE 646 & ECE 797/798/799/998

• ECE 646 project can be extended intoa Research Project, Master’s Thesis, PhD Thesis

6

After completing 18 credit hours of graduate work, a student1. Chooses a 600-700 level course to fulfill his/her

ECE 797 requirement2. Registers for ECE 797 via Patriotweb by first requesting

an override from the Academic Programs Coordinator, Ms. Patricia Sahs ([email protected]), before the last day to add classes

3. Chooses a project topic in consultation with the instructor4. Submits a single ECE 797 Entry Form, signed by the

instructor and the student, to the Main Office by the end of the 5th week of classes in a given semester

5. Works on a project individually6. Submits written report and gives short oral presentation7. Asks the instructor to fill and sign the ECE 797 Evaluation

Form, and submits this form to the main ECE Office 31

Scholarly Paper (1) Scholarly Paper (2)

The paper and presentation must follow accepted standards for• English• technical merit• literature analysis• citation of references• GMU Honor Code

In order to pass, the student cannot receive an Unacceptable score for any evaluated outcome

Students are encouraged to sign for ECE 797 in their lastbut one semester which guarantees at least two attempts

International Students’ Olympiad in Cryptography NSUCRYPTO - 2017

http://www.nsucrypto.nsu.ru

First Round: October 22, 2017Duration: 4 hrs 30 minSection B: for University students and professionals

Second Round: October 23-30, 2017Team RoundSolving hard research and programming problems of crypto

Bonus points for the participationand solving the competition problems!

NSUCRYPTO - 2016

“Typical” course

time

difficulty

This coursedifficulty

time

Follow-up coursesCryptography and Computer Network Security

ECE 646

Advanced Applied Cryptography

ECE 746

Computer ArithmeticECE 645

Digital System Design with VHDL

ECE 545

Cryptographic Engineering

ECE 747

Software/Hardware CodesignECE 615

7

Cryptography and ComputerNetwork Security

Advanced Applied Cryptography

• 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

• 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

- e-mail: PGP and S-MIME- www: SSL/TLS

• Cryptographic standards

Modular integer arithmetic Operations in the Galois Fields GF(2n)