CIS-6930-01 -- Spring 2006

Adv. Topics in Cryptography and Network Security 

Instructor

Breno de Medeiros


Assistant Professor







Smiling picture of Breno                     
Mailing address
Florida State University
105-D James Love Bldg
Tallahassee   FL 32306-4530
United States

Quick Shortcuts

Class meeting time/place
Textbook
Essays
Assignments
Lecture Slides
Grading
Policies

Class and Office Hour Times

Class meetings:     Tuesdays and Thursdays, 5:15--6:30pm.

Office hours:         Tuesdays & Wednesdays, 3:00--5:00pm, and by appointment.

Lecture location:   LOVE 0103

Office location:    
LOVE 0269

Course Goals

  1. Learn about formalization of security properties for cryptographic primitives and network security protocols.

  2. Understand the structure of a security analysis/ security proof of a cryptographic primitive and network security protocol.

  3. Read foundational and current research papers in cryptography, applied cryptography, and network security.

  4. Write a workshop or conference-quality paper in a security-related topic.

Grading

Letter grades will be based on numerical grades as follows: Plus/Minus letter grades will be assigned at the discretion of the instructor.

Course Syllabus

This webpage is the definitive syllabus for the course.  Please refer to this document for announcements,  graded activities-related information, as well as general policies that apply to all students enrolled in this course.

Textbook

Other recommended books:

Introductory background: reading assignments

First week (01/10--01/16):  Read textbook sections 4.1--4.3.  Then read the Wikipedia articles on the complexity classes P and NP, and the probabilistic complexity classes PPRP, and BPP.  Then return to the textbook and  read section 4.4.  Are the definitions on Wikipedia and on section 4.4 equivalent?

Second week (01/17--01/23):  Read paper [BAJR-97], below.

Third week (01/24--01/30):  Review probability, the Chernoff bound, and entropy.  Book chapter 3, and the wikipedia article on the Chernoff bound: http://en.wikipedia.org/wiki/Chernoff_bound

 Lecture Slides

Essays

You are expected to work on a paper this semester.  You can choose any topic in security or cryptography.  There will be several deadlines during the semester for you to submit revisions of the paper.  I will add comments on improvements and suggestions for further material.  At the end, you are expected to have a publication-quality work.

Implementation is not a required part of the research for this paper.  However, if you would like to work on an implementation, I will provide guidance on that aspect as well.

Policies

I expect students to arrive on-time for the class.  Classroom participation constitutes 15% of the grade in this class.  You will be expected to have previously read the reading assignment before the class, and to be able to participate in classroom discussions.

The students are also required to abide the the University's Honor Code.  Basically, do not represent other persons' work as your own, properly cite sources, and do not intentionally seek to undermine the efforts of your classmates.

Requests for extensions and for making up exams required a documented reason.
An example of adequate documentation of a medical reason for missing an exam is a discharge notice from the Student Health Center.

All students registered in this course (and all courses throughout the University) are bound by the Academic Honor Code.  Plagiarism (use of somebody else's work without proper acknowledgment) will not be tolerated.

A copy of the full University Academic Honor Code can be found in the current Student Handbook.

Notice of Compliance with the Disabilities Act

Students with disabilities needing academic accommodations should register with and provide documentation to the Student Disability Resource Center (SDRC), and bring a letter from the SDRC to the instructor indicating their needs. This should be done within the first week of class. 

Research Papers for Required or Recommended ReadinG


Last updated: 

Valid HTML 4.01 Transitional