1 / 8

CSE 5351: Introduction to Cryptography

CSE 5351: Introduction to Cryptography. Ten H. Lai Spring 2014 MW 15:55-17:15, DL369 . Syllabus. Instructor: Ten H. Lai Office: DL 581 Office hours: MWF 1:00-1:40 pm Email: lai.1@osu.edu Home page: www.cse.ohio-state.edu/~lai. Textbooks. (Required) Jonathan Katz & Yehuda Lindell

hanley
Download Presentation

CSE 5351: Introduction to Cryptography

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE 5351:Introduction to Cryptography Ten H. Lai Spring 2014 MW 15:55-17:15, DL369

  2. Syllabus • Instructor: Ten H. Lai • Office: DL 581 • Office hours: MWF 1:00-1:40 pm • Email: lai.1@osu.edu • Home page: www.cse.ohio-state.edu/~lai

  3. Textbooks • (Required) Jonathan Katz & Yehuda Lindell Introduction to Modern Cryptography Chapman & Hall/CRC, 2008 • (Reference) Hans Delfs & Helmut Knebl Introduction to Cryptography (2nd edition) Springer, 2007

  4. Grading plan • Homework (20%) • Midterm exam (35%) • Final exam (35%) • Attendance (10%) • Midterm: Wednesday, February 26 • Final exam: Monday April 28 4:00pm-5:45pm

  5. Class attendance • Class attendance is ESSENTIAL for understanding the materials --- and you earn credit! • Attendance will be taken on random dates. • If you have to miss a class for a legitimate reason, please email me in advance. • Please be on time for class!

  6. This course is about … • Theory/principle and some practical constructions of various cryptographic primitives and protocols. • Chapter 1-4, 5, 7, 9, 10, 12 of Katz & Lindel • Part of Chapter 4 of Delfs & Knebl

  7. Prerequsites • Stat 3460 or Stat 3470 or Stat 427 • CSE 2331 or CSE 5331 or CSE 680 or Math 4573 or Math 573 or Math 4580 or Math 580 • Some maturity in mathematical reasoning

  8. Mathematics background • Basic Probability (important for understanding the concepts) • Modular arithmetic (absolutely needed) • Algebra (basic concept of group theory)

More Related