| １． |
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 DP1 of the division of the integrated science and engineering, graduated school of Teikyo University.
<Comments>
訂正無し
|
| ２． |
Objectives |
|
The goal of this class is that students master the following abilities;
Students can explain basic crypto systems, one-way(Hash) functions, pseudo random number generator and cryptographic protocols.
Students can evaluate the security of crypto systems from the information theoretic point of view.
Students can evaluate the security of crypto systems or cryptographic protocols from the computational point of view.
Students can explain probabilistic computations, probabilistic protocols and probabilistic proofs.
Students can explain basic features and bit security of one-way functions.
Students can explain the probable security of crypto-related techniques.
<Comments>
訂正無し
|
| ３． |
Grading Policy |
|
Grading policy:
Mid-term report(50%), Final report (50%).
The way of feedback;
Answers for questions or feedback for the contents of class, worksheets, and examination will be given in a class, through LMS or in office hours.
<Comments>
Grading policy:
Mid-term report(50%), Final report (50%).
The way of feedback;
Answers for questions or feedback for the contents of class, worksheets, and examination will be given in a class, through LMS or during the office hours.
|
| ４． |
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.
<Comments>
訂正無し
|
| ５． |
Requirements (Assignments) |
|
Teaching materials of this or last years will be published through LMS. In addition, small quizzes for each class will be published through LMS. Though quizzes are not used for grading. students should utilize to review each class.
Before or after taking each class, students should review notes and related materials published through LMS.
In a semester, students should study over 30 hours addition to each class.
<Comments>
Teaching materials of this or last years will be published through LMS. In addition, small quizzes for each class will be published through LMS. Although, quizzes are not used for grading, students should utilize to review each class.
Before or after attending each class, students should review notes and related materials published through LMS.
In a semester, students should study over 30 hours addition to each class.
|
| ６． |
Note |
|
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.
It is preferable for students to take courses related to information security, e.g. Information Security in the Master's program･2nd semester, Graduate School of Science and Engineering
<Comments>
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.
It is preferable for students to take courses related to information security, e.g. Information Security, in the Master's program･2nd semester, Graduate School of Science and Engineering
|
| ７． |
Schedule |
|
１. Algebraic Systems
<Comments>
訂正無し |
２. Elementary number theory
<Comments>
訂正無し |
３. Probabilistic theory
<Comments>
訂正無し |
４. Information theory
<Comments>
訂正無し |
５. Complexity theory
<Comments>
訂正無し |
６. Probabilistic computation
<Comments>
訂正無し |
７. Introduction to the modern cryptography1 -Secret-Key Cryptography-
<Comments>
訂正無し |
８. Introduction to the modern cryptography2 -Public-Key Cryptography-
<Comments>
訂正無し |
９. Cryptographic protocols
<Comments>
訂正無し |
10. Probabilistic Proofs1 -Zero-Knowledge Proof-
<Comments>
訂正無し |
11. ProbabilisticProofs2 -Probabilistic Checkable Proof-
<Comments>
Probabilistic Proofs2 -Probabilistic Checkable Proof- |
12. One-way function -Basic assumptions-
<Comments>
訂正無し |
13. One-way function2 -Bit bit security-
<Comments>
訂正無し |
14. Provable security1
<Comments>
訂正無し |
15. Provable security2
<Comments>
訂正無し |
|
| １． |
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 DP1 of the division of the integrated science and engineering, graduated school of Teikyo University.
<Comments>
訂正無し
|
| ２． |
Objectives |
|
The goal of this class is that students master the following abilities;
Students can explain basic crypto systems, one-way(Hash) functions, pseudo random number generator and cryptographic protocols.
Students can evaluate the security of crypto systems from the information theoretic point of view.
Students can evaluate the security of crypto systems or cryptographic protocols from the computational point of view.
Students can explain probabilistic computations, probabilistic protocols and probabilistic proofs.
Students can explain basic features and bit security of one-way functions.
Students can explain the probable security of crypto-related techniques.
<Comments>
訂正無し
|
| ３． |
Grading Policy |
|
Grading policy:
Mid-term report(50%), Final report (50%).
The way of feedback;
Answers for questions or feedback for the contents of class, worksheets, and examination will be given in a class, through LMS or in office hours.
<Comments>
Grading policy:
Mid-term report(50%), Final report (50%).
The way of feedback;
Answers for questions or feedback for the contents of class, worksheets, and examination will be given in a class, through LMS or during the office hours.
|
| ４． |
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.
<Comments>
訂正無し
|
| ５． |
Requirements (Assignments) |
|
Teaching materials of this or last years will be published through LMS. In addition, small quizzes for each class will be published through LMS. Though quizzes are not used for grading. students should utilize to review each class.
Before or after taking each class, students should review notes and related materials published through LMS.
In a semester, students should study over 30 hours addition to each class.
<Comments>
Teaching materials of this or last years will be published through LMS. In addition, small quizzes for each class will be published through LMS. Although, quizzes are not used for grading, students should utilize to review each class.
Before or after attending each class, students should review notes and related materials published through LMS.
In a semester, students should study over 30 hours addition to each class.
|
| ６． |
Note |
|
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.
It is preferable for students to take courses related to information security, e.g. Information Security in the Master's program･2nd semester, Graduate School of Science and Engineering
<Comments>
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.
It is preferable for students to take courses related to information security, e.g. Information Security, in the Master's program･2nd semester, Graduate School of Science and Engineering
|
| ７． |
Schedule |
|
１. Algebraic Systems
<Comments>
訂正無し |
２. Elementary number theory
<Comments>
訂正無し |
３. Probabilistic theory
<Comments>
訂正無し |
４. Information theory
<Comments>
訂正無し |
５. Complexity theory
<Comments>
訂正無し |
６. Probabilistic computation
<Comments>
訂正無し |
７. Introduction to the modern cryptography1 -Secret-Key Cryptography-
<Comments>
訂正無し |
８. Introduction to the modern cryptography2 -Public-Key Cryptography-
<Comments>
訂正無し |
９. Cryptographic protocols
<Comments>
訂正無し |
10. Probabilistic Proofs1 -Zero-Knowledge Proof-
<Comments>
訂正無し |
11. ProbabilisticProofs2 -Probabilistic Checkable Proof-
<Comments>
Probabilistic Proofs2 -Probabilistic Checkable Proof- |
12. One-way function -Basic assumptions-
<Comments>
訂正無し |
13. One-way function2 -Bit bit security-
<Comments>
訂正無し |
14. Provable security1
<Comments>
訂正無し |
15. Provable security2
<Comments>
訂正無し |
|
|