Cybersecurity is important for our daily lives including various types of activities. There is a growing demand for students who can be researchers and engineers capable of understanding cybersecurity.
In order to satisfy this demand, Tokyo Tech has launched Progressive Graduate Minor in Cybersecurity in April, 2016. We design the curriculum of Progressive Graduate Minor in Cybersecurity in collaboration with NRI as the core, also with Rakuten, NTT, AIST, and NISC. The following six courses are organized in School of Computing: Foundation of Cybersecurity (1Q, 2-0-0), Theory of Cryptography for Cybersecurity (3Q, 2-0-0), Cybersecurity Governance (3Q, 1-1-0), Attack and Defense on Cybersecurity I (2Q, 1-1-0), Attack and Defense on Cybersecurity II (3Q, 1-1-0), and Attack and Defense on Cybersecurity III (4Q, 1-1-0).
This course is one of the core courses in this minor. This course aims to help students to understand the theory of cryptography as a fundamental element of cybersecurity. In particular, this course mainly gives models, schemes, and security proofs appeared in the theory of cryptography related to cybersecurity.
By the end of this course, students will be able to understand:
1) models in cryptography as a fundamental element of cybersecurity
2) systems and algorithms in cryptography as a fundamental element of cybersecurity
3) techniques for security proofs in cryptography as a fundamental element of cybersecurity.
cryptography, security, information security, cybersecurity, security proof
✔ Specialist skills | Intercultural skills | Communication skills | ✔ Critical thinking skills | ✔ Practical and/or problem-solving skills |
The class offers a standard type of lecture.
Course schedule | Required learning | |
---|---|---|
Class 1 | The theory on public-key encryption (and symmetric-key encryption) (1) | Understand the notions of the models |
Class 2 | The theory on public-key encryption (and symmetric-key encryption) (2) | Understand the notions of the models |
Class 3 | The theory on public-key encryption (and symmetric-key encryption) (3) | Understand the algorithms for the schemes |
Class 4 | The theory on public-key encryption (and symmetric-key encryption) (4) | Understand the algorithms for the schemes |
Class 5 | The theory on public-key encryption (and symmetric-key encryption) (5) | Understand the methods of the security proofs |
Class 6 | The theory on digital signature (1) | Understand the notions of the models |
Class 7 | The theory on digital signature (2) | Understand the algorithms for the schemes |
Class 8 | The theory on digital signature (3) | Understand the algorithms for the schemes |
Class 9 | The theory on digital signature (4) | Understand the methods of the security proofs |
Class 10 | The theory on digital signature (5) | Understand the methods of the security proofs |
Class 11 | Secret sharing and multiparty computation (1) | Understand the notions of the models |
Class 12 | Secret sharing and multiparty computation (2) | Understand the notions of the models |
Class 13 | Secret sharing and multiparty computation (3) | Understand the algorithms for the schemes |
Class 14 | Secret sharing and multiparty computation (4) | Understand the algorithms for the schemes |
To enhance effective learning, students are encouraged to spend approximately 100 minutes preparing for class and another 100 minutes reviewing class content afterwards (including assignments) for each class.
They should do so by referring to textbooks and other course material.
Textbooks will be used in this course.
References will be announced in the classes.
The evaluation consists of the reports as homework assignments. There will be approximately three reports. The weights of the scores of the reports are equal. The total score is calculated by adding all of the scores.
None. However, the knowledge on the basic notions of computer science can help students to understand the contents of the course smoothly.
keisuke[at]is.titech.ac.jp
Appointment by e-mail is required.