CMSC 443/652: Cryptography and Data Security Spring 2020

  • Welcome to the CMSC 443/652 Class!
  • Instructor: Haibin Zhang
  • hbzhang at umbc dot edu (best way to reach me)
  • Office: ITE 357
  • Office Hours: TuTh 11:15am - 12:00pm
  • Class Time: TuTh 10:00am - 11:15am
  • TA: Ajinkya Borle; Email: aborle1 at umbc dot edu

Additional information

  • Welcome to the crypto world. The goal is to learn crypto and how to use crypto. Compared to last year's course, the course will be less math intensive. Still, the course has a significant mathematical component. Students are expected to have "mathematical maturity" (e.g., combinatorics, probability, discrete mathematics) since many of the concepts will be abstract, rigorous definitions (and proofs) will be given, and some new mathematics (e.g., group theory, number theory) will be introduced. Basic background in discrete mathematics (probability, modular arithmetic) is assumed. If you know theory of computation or computational complexity, great! Another significant change is to introduce final projects for the course so that you gain some hands-on experience.

Academic conduct

  • The UMBC academic integrity policy is available at http://oue.umbc.edu/ai/ All writing and presentation must be entirely your own. You need to reference things that are not yours. If you have done a similar project previously, please let me know and let's discuss if new things could be built upon your previous project. You need to explicitly acknowledge any help you received for any writing and presentation. If you do not include a statement, it is assumed you work completely independently.
  • Cases of academic dishonesty will be dealt with seriously. Depending on its severity, it can be an F for the course.

Textbooks

  • Introduction to Modern Cryptography (Chapman & Hall/CRC Cryptography and Network Security Series) 2nd Edition by Jonathan Katz and Yehuda Lindell. (The first edition will not work.)

Grading

  • Attendance and participation: 10%: We will track student attendance for every class.
  • Q&A: 20%. We will announce (relatively easy) questions before the class to promote active learning. You need read the textbook and answer the quesdtions in written form. Your answers should be handed in before the class starts. They will be graded according to "with or without efforts."
  • HWs: 10%. As we have Q&A, we do not have a lot of HWs.
  • Midterm: 20%
  • Final: 40% (after-midterm presentation, final presentation, final report, codes if any)
  • Note: Entries for future dates are tentative and subject to change as the semester progresses. Readings refer to Introduction to Modern Cryptography, 2nd edition.
  • slides will be posted when available; however, slides will not be used for all lectures.
No. Class Date Topic Slides Reading
1 Jan 29 Introduction and overview