CSE 651:
Introduction to Network Security
Steve Lai Spring 2010
1
Syllabus
Instructor: Steve Lai Office: DL 581 Office hours: MWF 2:30-3:30 Email: [email protected] Home page: www.cse.ohio-state.edu/~lai
2
Text (required)
William Stallings Cryptogr
CSE 651 Homework 5
Due: Wednesday, May 12 by class time (10:30 am)
Midterm Exam II: Monday,
May 17
Scope: Public-key cryptography and RSA, including the math used in RSA. Open book, open notes
1. Do Problem 9.16 of Stallings. (You may use the algorithm in
CSE 651 Homework 4
Due: Friday, May 7 by class time
1. List all elements of Z10 .
* 2. (a) List all elements of Z10 . (b) What is the value of (10) ? * * 3. Find the order of each element in Z10 . (Check that x (10) 1 for all x Z10 .)
4. Do b and c of Pro
CSE 651 Homework 3
Due: Friday, April 23 by class time (10:30 am)
Midterm Exam 1: Monday, April 26 Scope: up to RC4 inclusively Open books/notes Calculators allowed
1. Do Problem 6.4 of Stallings. (Interpret part b as follows: After encrypting the entire
CSE 651 Homework 2
Due: Monday, April 19 by class time
1. Do Problem 3.2 of Stallings. (Hints: (1) The information about 128-bit block size and key length is not important. (2) Imagine that there is an oracle who can encrypt one message of your choice for
CSE 651 Homework 1
Due: Monday, April 12 by class time
1. Do Problem 2.5 of Stallings (4th or 5th edition). You only have to answer (a) and give the plaintext. (Hint: the encryption algorithm is one of those we have discussed in class.) 2. Do Problem 2.10
Announcement
Final exam: Wed, June 9, 9:30-11:18 Scope: materials after RSA (but you need to know RSA) Open books, open notes. Calculators allowed.
1
We have learned
Symmetric encryption: DES, 3DES, AES, RC4 Public-key encryption: RSA Hash: SHA-1 MAC:
Announcement
Final exam: Wed, June 9, 9:30-11:18 Scope: materials after RSA (but you need to know RSA) Open books, open notes. Calculators allowed.
1
We have learned
Symmetric encryption: DES, 3DES, AES, RC4 Public-key encryption: RSA Hash: SHA-1 MAC:
Entity Authentication and Key Agreement
CSE 651
Entity Authentication
Problem: Alice wants to prove to Bob that she is Alice and/or vice versa. Basic idea: Alice shows that she knows some secrecy which is presumably known only to Alice (and Bob). That se
Entity Authentication and Key Agreement
CSE 651
Entity Authentication
Problem: Alice wants to prove to Bob that she is Alice and/or vice versa. Basic idea: Alice shows that she knows some secrecy which is presumably known only to Alice (and Bob). That se
Cryptographic Hash Functions Message Authentication Digital Signatures
Abstract
We will discuss Cryptographic hash functions Message authentication codes
HMAC and CBC-MAC
Digital signatures
2
Encryption/Decryption
Provides message confidentiality. Does
Cryptographic Hash Functions Message Authentication Digital Signatures
Abstract
We will discuss Cryptographic hash functions Message authentication codes
HMAC and CBC-MAC
Digital signatures
2
Encryption/Decryption
Provides message confidentiality. Does
Block Cipher Modes of Operation and Stream Ciphers
CSE 651: Introduction to Network Security
Abstract
We will discuss
How to use block ciphers? RC4: a widely used stream cipher Problems with WEPs use of RC4
2
Modes of Operations
How to use a block ciphe
Classical Encryption Techniques
CSE 651: Introduction to Network Security
Classical encryption techniques
As opposed to modern cryptography Goals:
to introduce basic concepts & terminology of encryption to prepare us for studying modern cryptography
2
B
CSE 651 Homework 6
Due: Wednesday, June 2 by class time
1. Do problem 12.3 on the 5th edition (or 12.10 on the 4th) of Stallings. (This problem shows that CBC-MAC is not secure.) 2.
Consider CMAC(m, k , k ): m m1 m2 ml , where |mi | n.
c0 IV (typically 0n