ECE 575 Data Security & Cryptography

Fall Term - CRN: 18847
Oregon State University
http://islab.oregonstate.edu/koc/ece575

Announcements

Schedule and Classroom: Monday, Wednesday, and Friday 3:00-3:50 PM, Owen Hall 106.
In order to view or print the PDF files, you need Adobe Reader. Make sure that you have the most recent version in your computer, otherwise, you may not be able to view or print the documents.
My office hours: MWF 4-5 PM & Tuesday 3-4 PM.
Project Presentation Day and Time: December 6, Monday 3-5pm. Email me your presentation on or before noon on Monday, Dec 6.
ECC Lectures by Prof. Tom Schmidt: Monday and Wednesday, November 29 and December 1. Prof. Schmidt will cover elliptic curve cryptography at 11 AM. The classroom is Owen Hall 320.

Grades

Grades (Updated on Dec 9)

Homework Assignments

Homework #1 - Due Friday, Oct 22 - Received Homeworks
2.13 Exercises: 5, 7, 10, 12, 13, 14
2.14 Computer Problems: 3, 5, 12, 13
Selected Solutions by Adam Browning
Homework #2 - Due Friday, Nov 5 - Received Homeworks
3.12 Computer Problems: 1, 2, 3, 4, 5, 6, 10
4.8 Exercises: 4, 5
Selected Solutions by Rhea Stadick
Homework #3 - Due Friday, Nov 19 - Received Homeworks
6.8 Exercises: 5, 8
6.9 Computer Problems: 2, 12, 13
7.5 Exercises: 4
15.6 Exercises: 2
15.7 Computer Problems: 1, 2, 4
Selected Solutions by Robert Rose

Homework assignments must be submitted by e-mail. Send Text, Image, MS Word, or PDF files.
Please name your file as your last name followed by homework number, for example, koc-hw1.pdf.
Also make sure that your name is printed within the homework file.

Midterm Examination

Midterm examination will be accessible at 4pm, Wednesday, November 17.
Midterm is due 11:59pm, Saturday, November 20.
Midterm Fall
Received Midterms

Plan of the Course

Week 1: Overview and Classical Cryptosystems (Chapters 1 and 2)
Week 2: Basic Number Theory (Chapter 3)
Week 3: Data Encryption Standard (Chapter 4)
Week 4: Advanced Encryption Standard (Chapter 5)
Week 5: RSA Algorithm (Chapter 6)
Week 6: Discrete Logarithms and Digital Signatures (Chapters 7 and 8)
Week 7: Elliptic Curve Cryptography (Chapter 15)
Week 8: Digital Cash, Secret Sharing Schemes (Chapters 9 and 10)
Week 9: Cryptographic Games, Zero-Knowledge Techniques (Chapters 11 and 12)
Week 10: Key Establishment and Quantum Cryptography (Chapters 13 and 17)

Class Projects for Fall Term

Project Requirements
Proposal Due Date: Wednesday, November 10
Project Due Date: Wednesday, December 8
Example Title & Abstract
Example Project
Project Ideas for Fall
Accepted Projects

Class Projects from Past Terms

Course Handouts

Differential Cryptanalysis PDF1 & PDF4
Public-Key Cryptography PDF1 & PDF4
Escrowed Encryption Systems PDF1 & PDF4
Fair Cryptography PDF1 & PDF4
RSA Implementation PDF1 & PDF4
Elliptic Curve Cryptosystems PDF1 & PDF4
Notes on Cryptography (by E. Kranakis) 00 01 02 03 04 05 06
Next Generation E-Commerce Security PS & PDF
Emerging Applications of Cryptography PS & PDF
High-Speed Cryptography PS & PDF
Wireless Security Implementation PS & PDF
Notes by E. Savaş
L1.pdf L2.pdf L3.pdf L1.ppt L2.ppt L3.ppt

More Course Handouts

Advanced Encryption Standard PDF
Introduction to Rijndael PDF
Security Basics: A Whitepaper PDF DOC
Minimal Key Lengths for Symmetric Ciphers ... PDF
Why Cryptosystems Fail PDF
Elliptic Curve DSA (ECDSA): An Enhanced DSA PDF
Selecting Cryptographic Key Sizes PDF
CRT and Inverse Computation PDF

Resources and Pointers

Motivation

This is an introductory course on the methods, algorithms, techniques, and tools of data security and cryptography. After studying the theoretical aspects of cryptographic algorithms and protocols, we show how these techniques can be integrated to solve particular data and communication security problems. This course material is of use to computer and communication engineers who are interested in embedding security into an information system, and thus, providing integrity, confidentiality, and authenticity of the documents and the communicating parties.

Topics

Introduction and Classical Cryptosystems: Secure communication. Attacks to cryptosystems. Classical cryptographic techniques and algorithms. Monoalphabetic and polyalphabetic systems.
Mathematical Foundations: Number theory. Finite fields. Primitive roots. Squareroots. Exponentiation and discrete logarithm.
Secret-Key Cryptography: Block ciphers and stream ciphers. DES, AES, RC4. Modes of operation.
Public-Key Cryptography: One-way functions. Trapdoor one-way functions. Public-key cryptosystems. RSA, Diffie-Hellman, ElGamal, and elliptic curve cryptosystems.
Authentication and Digital Signatures: Cryptographic checksums. Hash functions and message-digest functions. Digital signatures. Authentication protocols.
Protocols: Digital cash. Sharing and partial disclosure of secrets. Games. Zero-knowledge proof systems. Identification protocols. Key management architectures.

Textbook

W. Trappe & L. C. Washington. Introduction to Cryptography with Coding Theory, Prentice-Hall, 2002. ISBN: 0-13-061814-4

More Information about the Textbook

Maple & Cryptography Links

Grading Policy

3 HW Assignments: 45 %
Midterm: 25 %
Project: 30 %

Prerequisites

This class is open to all graduate students.

Dr. Cetin Kaya Koc

http://islab.oregonstate.edu/koc
E-Mail: koc@ece.orst.edu
Tel: (541) 737 4853
Fax: (541) 737 1300
Office: Owen Hall 304