Foundations of Network and Computer Security Computer
John Black
Lecture #10 Sep 18th 2009
CSCI 6268/TLEN 5550, Fall 2009
But first, a little math
A group is a nonempty set G along with an operation # : G x G G such that for all a, b, c G
(a # b) # c =
CSCI 6268/TLEN 5831: Network Security CU John Black
Handout P1 October 16, 2009
Project 1
Due Weds, October 28th, in class
Overview. This part of the project is quite straightforward: you want to obtain a certicate from our CA, me. To do this, rst generat
Project #2: Secure Email System
Page 1 of 4
Project #2: Secure Email System
Due: Fri, December 4th in class
(CAETE students may email their project to me) As advertised, in this project you will provide a secure email system for use within this class. You
Foundations of Network and Computer Security Computer
John Black
CSCI 6268/TLEN 5550, Fall 2009
Introduction
UC Davis
PhD in 2000 Cryptography Interested in broader security as well
UNR two years CU Boulder seven years My teaching style and personality
Foundations of Network and Computer Security
John Black
Lecture #2 Aug 26th 2009
CSCI 6268/TLEN 5550, Fall 2009
Slides now Available online
http:/engineeringonline.colorad Write it down; won't post to web page
Laws
DMCA
Felten RIAA/SDMI case most famou
Foundations of Network and Computer Security Computer
John Black
Lecture #3 Aug 28th 2009
CSCI 6268/TLEN 5550, Fall 2009
Quiz #1
Friday
A week from today, Sep 4th
Covers reading and lectures up to Weds Sep 2nd In class, 50mins, closed notes, no calcula
Foundations of Network and Computer Security Computer
John Black
Lecture #4 Aug 31st 2009
CSCI 6268/TLEN 5550, Fall 2009
Lets build a Better Blockcipher
DES The Data Encryption Standard
64-bit blocksize, 56 bit key Formerly called Lucifer
Developed by
Foundations of Network and Computer Security Computer
John Black
Lecture #5 Aug 31st 2009
CSCI 6268/TLEN 5550, Fall 2009
How about Triple-DES!
Triple DES uses a 168-bit key K=(K1, K2, K3)
TDESK(P) = DESK3(DESK2(DESK1(P)
No known attacks against TDES
Pr
Foundations of Network and Computer Security Computer
John Black
Lecture #6 Sep 9th 2009
CSCI 6268/TLEN 5550, Fall 2009
Digression on the One-Time Pad
Suppose Alice and Bob shared a 10,000 bit string K that was secret, uniformly random
Can Alice send Bo
Foundations of Network and Computer Security Computer
John Black
Lecture #7 Sep 11th 2009
CSCI 6268/TLEN 5550, Fall 2009
The Big (Partial) Picture
Second-Level Protocols (Can do proofs) First-Level Protocols (Can do proofs)
SSH, SSL/TLS, IPSec Electronic
Foundations of Network and Computer Security Computer
John Black
Lecture #8 Sep 14th 2009
CSCI 6268/TLEN 5550, Fall 2009
The Ubiquitous HMAC
The most widely-used MAC (IPSec, SSL, many VPNs) Doesnt use a blockcipher or any universal hash family
Instead u
Foundations of Network and Computer Security Computer
John Black
Lecture #9 Sep 16th 2009
CSCI 6268/TLEN 5550, Fall 2009
Announcements
Quiz #2 will be next Friday, Sep 25th
Will cover material up to next Weds 9/23
Birthday Paradox
Need another method
CSCI 6268/TLEN 5831: Network Security CU John Black
Handout P0 October 3, 2009
Project 0
Due Friday, October 14th, in class
Problem 1. I have encrypted some message with the following OpenSSL command: % openssl enc -aes128 -base64 < secret-message enter a