Scribd
Upload
74 views2 pages

Cryptography

This document provides information about the CMSC/Math 456: Cryptography course for the Fall 2022 semester. It outlines the instructor and teaching assistant contact details, topics to be covered including classical cryptography, modern private/public key encryption, authentication techniques. The learning objectives are listed as understanding cryptographic protocols, what makes them secure/insecure, and basic real world protocols like AES and RSA. Important dates for midterm, final exams and problem set deadlines are provided. Grades will be based on problem sets, midterm and final exams. Late problem sets will not be accepted without an approved extension.

Uploaded by

erdhananjay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views2 pages

Cryptography

This document provides information about the CMSC/Math 456: Cryptography course for the Fall 2022 semester. It outlines the instructor and teaching assistant contact details, topics to be covered including classical cryptography, modern private/public key encryption, authentication techniques. The learning objectives are listed as understanding cryptographic protocols, what makes them secure/insecure, and basic real world protocols like AES and RSA. Important dates for midterm, final exams and problem set deadlines are provided. Grades will be based on problem sets, midterm and final exams. Late problem sets will not be accepted without an approved extension.

Uploaded by

erdhananjay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CMSC/Math 456: Cryptography

Instructor: Daniel Gottesman


Fall 2022

Contact Information
Lectures: Tuesday, Thursday 12:30-1:45 PM, IRB 0318
Instructor: Daniel Gottesman (e-mail: [email protected], office hours Tuesday 10:30-11:30 AM, Atlantic
3251)
Teaching Assistants:
• Amadeo David De La Vega Parra (e-mail: [email protected], office hours Thursday 9:15-10:45 AM,
AVW 4122)
• Samira Goudarzi (e-mail: [email protected], office hours Wednesday 2:00-3:30 PM, AVW 4122)
• Mahathi Vempati (e-mail: [email protected], office hours Monday 1:30-2:30 PM, AVW 4122)

Topics Covered
• Classical cryptography
• Modern private-key cryptography (including one-time pad, pseudorandom generators and functions,
security definitions and proofs, DES, AES)
• Public key encryption (including purpose and applications, RSA)
• Authentication (including message authentication codes, digital signatures)
• Additional advanced topics, as time permits (possibilities include post-quantum cryptography, quantum
key distribution, secure multiparty computation, homomorphic encryption, blockchain)

Learning Objectives
• Terminology, types, and techniques of cryptographic protocols
• What makes a protocol secure or insecure
• Basic understanding of particular protocols used in real world, such as AES and RSA

Important Dates
• Mid-term exam: Thursday, Oct. 20 (in class)
• Thanksgiving: Thursday, November 24 (no class)
• Last lecture: Thursday, December 8
• Final exam: Monday, Dec. 19, 1:30 - 3:30 PM (location TBA)

1
Grades
Your grade will have 3 components:
• Problem sets (30%)
• Mid-term exam (30%)
• Final exam (40%)

Additional notes on grading and assignments:

• The problem sets will be available on this web page.


• The problem sets will be turned in on Gradescope.
• The problem sets will be a mix of theory-focused problems and programming assignments.
• The problem set grade will be determined by dropping the highest and lowest grades and then averaging
the remaining scores.
• By default, the scores will not be curved. However, I may curve up the grades for any problem set
or exam if I decide it was substantially harder than I expected. I will not curve down grades if the
assignment is easier than expected.
• For the problem sets, if you use any external material to solve it (other than the lectures and textbook),
cite the source and indicate what you took from it.
• You may discuss problem sets with other students, but you must understand and write up your solution
or code by yourself. If you do collaborate, indicate who you talked to on your assignment.
• Late problem sets will not be accepted unless an extension is granted by me or one of the TAs before
the problem set is due.
– Note that the extension must be granted before the deadline, not requested before the deadline.
Be sure to leave enough time to get a response (24 hours should be sufficient).
– Extension requests should specify a valid reason and how long an extension you are requesting.
Medical, religious, family emergency are examples of valid reasons (not an exhaustive list). “I
have an assignment due in another class” is not a valid reason: Plan ahead!
– Maximum extension is 1 week, so that we can distribute solutions. If you have a valid reason for
a longer extension, discuss with me.

General Information
• Textbook: Katz & Lindell, Introduction to Modern Cryptography
• Lectures will be recorded and available through the course’s page on ELMS. However, I strongly
recommend that you attend class and not rely on the recordings to follow the class.
• There will be a Piazza (https://piazza.com/umd/fall2022/cmsc456) for asking questions on the class.
Unless you have a question that is very specific to you personally, please use the Piazza to ask questions.
This includes questions about both the content and administration of the course.

You might also like