Classical encryption methods. What is meant by secure encryption? Background in information theory, entropy. Symmetric encryption algorithms, for example the Advanced Encryption Standard (AES). Public-key cryptosystems for encryption and digital signatures, e.g., RSA, ElGamal, and Schnorr signatures. Cryptographically secure hash functions in theory and practice (SHA). Properties and examples of pseudo random number generators. Connections between complexity theory and cryptography.
DD2449 Foundations of Cryptography 6.0 credits
This course has been discontinued.
Last planned examination: Spring 2012
Decision to discontinue this course:
No information inserted
Course offerings are missing for current or upcoming semesters.
Headings with content from the Course syllabus DD2449 (Autumn 2009–) are denoted with an asterisk ( )
Content and learning outcomes
Course contents
Intended learning outcomes
After a completed course, the student should be able to
- discuss the following basic concepts in cryptography:
symmetric and asymmetric encryption, digital signatures, cryptographic hash functions and strong pseudorandom generators and to give examples of instantiations of each concept - conduct simple analyses of cryptographic constructions such as cryptosystems and cryptographic protocols
- read analyses performed by others of cryptographic constructions such as cryptosystems and cryptographic protocols and decide if the given analysis can be trusted
- read and understand technical articles in cryptography.
Literature and preparations
Specific prerequisites
No information inserted
Recommended prerequisites
Knowledge equivalent to either one of the courses DD1352 Algorithms, Data Structures and Complexity or DD2354 Algorithms and Complexity and knowledge of probability theory, mathematics and algorithm theory acquired in the mandatory courses of the D or F program.
Equipment
No information inserted
Literature
Stinson, Cryptography; theory and practice, Chapman & Hall.
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale
A, B, C, D, E, FX, F
Examination
- ÖVN1 - Hand in Task, 6.0 credits, grading scale: A, B, C, D, E, FX, F
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
In this course all the regulations of the code of honor at the School of Computer science and Communication apply, see: http://www.kth.se/csc/student/hederskodex/1.17237?l=en_UK.
Other requirements for final grade
Written exercises (OVN1; 6 university credits).
Opportunity to complete the requirements via supplementary examination
No information inserted
Opportunity to raise an approved grade via renewed examination
No information inserted
Examiner
Ethical approach
- All members of a group are responsible for the group's work.
- In any assessment, every student shall honestly disclose any help received and sources used.
- In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.
Further information
Course room in Canvas
Registered students find further information about the implementation of the course in the course room in Canvas. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.
Offered by
Main field of study
Computer Science and Engineering, Information Technology, Information and Communication Technology
Education cycle
Second cycle
Add-on studies
Please discuss with the instructor.
Contact
Johan Håstad, tel: 790 6289, e-post: johanh@csc.kth.se
Supplementary information
The course is replaced by DD2448 Foundations of Cryptography, 7,5 credits.