SYLLABUS

 

Course ID         CE 340

 

Course Name       Cryptography and Network Security

 

Semester          Fall, 2010

 

Instructor        Prof. Dr. Mehmet E. DALKILIÇ

 

E-Mail            mehmet.emin.dalkilic@ege.edu.tr

                 

Class Times       Wednesday 14:30 – 17:20 M309

 

Office Hours      TBA

 

Course Objectives This course introduces students to the basic building blocks of cryptographic systems as well as network security techniques. The objective of the course is to provide the basic knowledge to understand the design and analysis of classis cryptosystems, block ciphers, stream ciphers, DES, RC5, Modes of operation of block ciphers, public key cryptosytems, RSA, Security Services, Data Integrity and Authentication, key management, Secure e-mail, secure Internet protocols.

COURSE TOPICS

 

BASIC CONCEPTS

KEY MANAGEMENT

CLASSICAL CRYPTOALGORITHMS

PUBLIC KEY CRYPTOALGORITHMS

SECURITY SERVICES

SECURE INTERNET PROTOCOLS

 

·         Historical Ciphers

·         Classical Encryption

(DES, IDEA, RC5, AES)

·         Modes of Operation

·         Public Key Encryption

(RSA, DH, DSA)

·         Hash functions and MACs

·         Digital signatures

·         Public key certificates

·         Secure Internet Protocols

o    E-mai: PGP and S-MIME

o    www: SSL

o    Network Layer Security: IPsec

o    Wireless LAN security: WEP

o    Operational security: Firewalls and IDS

 

Useful security software tools: 

·         Cryptool,

·         PGP

 

Textbook          W. Stallings, Cryptography and Network Security: Principles and Practices,

                   5/E, Prentice Hall, 2011 (http://williamstallings.com/Crypto/Crypto5e.html

 

Suggested reading: Simon Singh, The Code Book: The Secret History of Codes and Code-breaking, 1999

                  (Also available in Turkish)

                  Kurose and Ross, Computer Networking: a Top-Down Approach, 5th ed.,Pearson 2010

 

Course Web Page   http://www.ube.ege.edu.tr/~dalkilic/courses/ce340_fall2010.html

                 

 

Evaluation Criteria (tentative !!)

                  Homeworks         : 20 %

                  Midterm I         : 20 %

                  Midterm II        : 20 %

                  Final             : 30 %

                  Participation     : 10 %

 

Attendance        Attendance in class is required at all times. Students are expected to be fully prepared to discuss textbook readings and course assignments.

 

Announcements     The students are expected to check their e-mails and the web site of the course for the announcements.

 

 

Lecture Slides    lecture1 

                     AuxSlides1

                     Turkish Language Characteristics

                  lecture2 

                     Auxslides2

                  lecture3

                     AuxSlides3

                  lecture4

                     AuxSlides4

                  lecture5

                     AuxSlides5a AuxSlides5b

                  lecture6

                  lecture7

                        AuxSlides7a

                  lecture8

                        AuxSlides8a

 

 

                 

 

Homework Policy !! (New Please Read !!)  

hpolicy

 

Homework #1 (Due date Oct 6th, 2010)

1.  Download and Install the latest version of Cryptool. (http://www.cryptool.org)

2.  Encrypt the following message:

SECURITY OF A CRYPTOSYSTEM MUST NOT DEPEND ON THE SECRECY OF ITS ALGORITHM.

using

a)  A shift cipher key = 13

b)  Vigenere Cipher with key “VIGENERE”

c)  Substitution Cipher with key “CIPHERS”

 

Homework #2 (Due date Oct 13th, 2010)

      Odev2fall2010.doc

 

Homework #3 (Due date Oct 20th, 2010)

     1. Problem 2.11 of our textbook paperback 5th ed. (on Playfair cryptosystem)

     2. Problem 2.24 of our textbook paperback 5th ed.

        (program to cryptanalyze monoalphabetic ciphers using IC test)

 

NEW NEW NEW Midterm dates: November 10th and December 18th (SATURDAY) in class exams

 

Make-up lecture date: November 13th, 15:30-18:20 (possibly in M309)

 

Homework #4 (due date Oct. 27th, 2010)

1.  Problem 2.14 (textbook 5th ed. paperback)

2.  Problem 2.15 (textbook 5th ed. paperback)

3.  Is Hill Cipher perfectly secure? Prove it is or disprove.

4.  Problem 3.8 (textbook 5th ed. paperback)

 

Homework #5 (due date Dec. 8th, 2010)

1.  Problems 8.4, 8.14, 8.18 and 8.20 (textbook 5th ed. paperback)

 

Homework #6 (due date Dec. 15th, 2010)

1.  Problems 9.2 a and b, 9.4, 9.15, and 9.18 (textbook 5th ed. paperback)

 

Homework #7 (due date Dec. 29th, 2010)

1.  Problems 11.1, 11.3, 11.4 and 11.5 (textbook 5th ed. paperback)

 

Homework #8 (Due date Jan 12th, 2010)

      Odev8fall2010.doc