| １． |
Outline |
|
This course strictly models and defines problems dealt in cryptographic protocols at first.
Then, we explain their security and related topics through mathematical proofs.
This course relates to the diploma policy 2 of the division of the integrated science and engineering, graduated school of Teikyo University.
|
| ２． |
Objectives |
|
In the modern society which is networked rapidly, information security technology has become indispensable
and its importance has been getting higher.
In this course, we model and define the cryptographic protocols and related concepts strictly.
Then we aim at understanding their security through mathematicall proofs with information theory and complexity theory.
|
| １． |
Outline |
|
This course strictly models and defines problems dealt in cryptographic protocols at first.
Then, we explain their security and related topics through mathematical proofs.
This course relates to the diploma policy 2 of the division of the integrated science and engineering, graduated school of Teikyo University.
|
| ２． |
Objectives |
|
In the modern society which is networked rapidly, information security technology has become indispensable
and its importance has been getting higher.
In this course, we model and define the cryptographic protocols and related concepts strictly.
Then we aim at understanding their security through mathematicall proofs with information theory and complexity theory.
|
| ３． |
Grading Policy |
|
A grade is evaluated in two reports(50%, 50%).
In the case that the number of days attended is less than 10, the student will be unqualified for this course.
As for reports submitted through LMS, feedback information will be given through LMS.
|
| ４． |
Textbook and Reference |
|
Reference: Oded Goldreich, "Modern Cryptography, Probabilistic Proofs and Pseudorandomness, (Algorithms and Combinatorics)" Springer, 1998.
ISBN-13:978-3642084324
Reference: Hans Delfs, Helmut Knebl, "Introduction to Cryptography: Principles and Applications (Information Security and Cryptography), "
Springer Berlin Heidelberg, 2007.
ISBN-13: 978-3540492436
Reference: Hans Delfs, Helmut Knebl, "Introduction to Cryptography: Principles and Applications(Information Security and Cryptography)
[Kindle], " Springer Berlin Heidelberg, 2007.
|
| ５． |
Requirements (Assignments) |
|
This course requires the knowledge of algebraic systems, the elementary number theory, the probabilistic theory, the information theory and the complexity theory while these theories will be reviewed in the introductory phase.
This course is highly professional and requires more profound understanding mathematically compared with courses in the undergraduate school.
|
| ６． |
Note |
|
Each is given as a lecture.
Necessary materials will be published through LMS.
|
| ７． |
Schedule |
|
| １. Algebraic Systems |
| ２. Elementary number theory |
| ３. Probabilistic theory |
| ４. Information theory |
| ５. Complexity theory |
| ６. Probabilistic computation |
| ７. Introduction to the modern cryptography1 -Secret-Key Cryptography- |
| ８. Introduction to the modern cryptography2 -Public-Key Cryptography- |
| ９. Cryptographic protocols |
| 10. Probabilistic Proofs1 -Zero-Knowledge Proof- |
| 11. ProbabilisticProofs2 -Probabilistic Checkable Proof- |
| 12. One-way function -Basic assumptions- |
| 13. One-way function2 -Bit bit security- |
| 14. Provable security1 |
| 15. Provable security2 |
|
|