| １． |
Outline |
|
This course provides an introduction to the algebraic system, finite field and number theory. The items are as follows: Operation and algebraic system, semi group and group, ring and field, transmission of information, error of codes, detection and correction of errors, finite field, Hamming code, cyclic code, BCH code, cryptosystem, integer, prime number and factorization into prime factors, Euclidean algorithm, diophantine linear equation, congruent expression, Fermat’s little theorem, and the RSA cryptosystem.
The classes are based on self-learning to read the designated text books and to answer the practice exercises prepared in each unit of the guidance book.
This subject is related to the clause 2 of the diploma policy of the Department of Information Science Correspondence Course.
|
| ２． |
Objectives |
|
The objectives of this course for students are to understand the basic concept of error correcting codes on the basis of finite field and the basic concept of the RSA cryptosystem which is one of the public key cryptosystems based on number theory.
|
| ３． |
Grading Policy |
|
The acceptance line is accuracy rate of 60% in the final exam.
The midterm papers(40%) and the final exam (60%) will be evaluated.
|
| ４． |
Textbook and Reference |
|
Textbook:
“Basics of Information Mathematics”, F.Terada, N.Nakamura, T.Syakushi and T.Matsui, Saiensu-Sha (1999) in Japanese. （ISBN 4-7819-0914-0）
Reference:
“New Information Mathematics”, T.Ueda, Makinoshoten (2004) in Japanese. （ISBN 4-434-04087-1）
|
| ５． |
Requirements (Assignments) |
|
Answering the practice exercises prepared in each unit of the guidance book is required as the midterm papers.
Preparation of numbers, expressions and operations and characteristics of integers on a high school level and introductory linear algebra is also required.
|
| ６． |
Note |
|
The assignments should be prepared by handwriting.
It is prohibited for students to refer the textbook and notebook in the final exam.
|
| ７． |
Schedule |
|
| １. Algebraic system : Operation and algebraic system, Semi group and group |
| ２. Algebraic system : Permutation group, Cyclic group |
| ３. Algebraic system : Ring and field |
| ４. Finite field and code : Transmission of information, Error of codes |
| ５. Finite field and code : Detection and correction of errors |
| ６. Finite field and code : Finite field |
| ７. Finite field and code : Hamming code |
| ８. Finite field and code : Cyclic code |
| ９. Finite field and code : BCH code |
| 10. Number theory and cryptosystem : Cryptosystem, Integer, Prime number and factorization into prime factors |
| 11. Number theory and cryptosystem : Euclidean algorithm |
| 12. Number theory and cryptosystem : Diophantine linear equation |
| 13. Number theory and cryptosystem : Congruent expression |
| 14. Number theory and cryptosystem : Fermat’s little theorem |
| 15. Number theory and cryptosystem : The RSA cryptosystem |
|
| １． |
Outline |
|
This course provides an introduction to the algebraic system, finite field and number theory. The items are as follows: Operation and algebraic system, semi group and group, ring and field, transmission of information, error of codes, detection and correction of errors, finite field, Hamming code, cyclic code, BCH code, cryptosystem, integer, prime number and factorization into prime factors, Euclidean algorithm, diophantine linear equation, congruent expression, Fermat’s little theorem, and the RSA cryptosystem.
The classes are based on self-learning to read the designated text books and to answer the practice exercises prepared in each unit of the guidance book.
This subject is related to the clause 2 of the diploma policy of the Department of Information Science Correspondence Course.
|
| ２． |
Objectives |
|
The objectives of this course for students are to understand the basic concept of error correcting codes on the basis of finite field and the basic concept of the RSA cryptosystem which is one of the public key cryptosystems based on number theory.
|
| ３． |
Grading Policy |
|
The acceptance line is accuracy rate of 60% in the final exam.
The midterm papers(40%) and the final exam (60%) will be evaluated.
|
| ４． |
Textbook and Reference |
|
Textbook:
“Basics of Information Mathematics”, F.Terada, N.Nakamura, T.Syakushi and T.Matsui, Saiensu-Sha (1999) in Japanese. （ISBN 4-7819-0914-0）
Reference:
“New Information Mathematics”, T.Ueda, Makinoshoten (2004) in Japanese. （ISBN 4-434-04087-1）
|
| ５． |
Requirements (Assignments) |
|
Answering the practice exercises prepared in each unit of the guidance book is required as the midterm papers.
Preparation of numbers, expressions and operations and characteristics of integers on a high school level and introductory linear algebra is also required.
|
| ６． |
Note |
|
The assignments should be prepared by handwriting.
It is prohibited for students to refer the textbook and notebook in the final exam.
|
| ７． |
Schedule |
|
| １. Algebraic system : Operation and algebraic system, Semi group and group |
| ２. Algebraic system : Permutation group, Cyclic group |
| ３. Algebraic system : Ring and field |
| ４. Finite field and code : Transmission of information, Error of codes |
| ５. Finite field and code : Detection and correction of errors |
| ６. Finite field and code : Finite field |
| ７. Finite field and code : Hamming code |
| ８. Finite field and code : Cyclic code |
| ９. Finite field and code : BCH code |
| 10. Number theory and cryptosystem : Cryptosystem, Integer, Prime number and factorization into prime factors |
| 11. Number theory and cryptosystem : Euclidean algorithm |
| 12. Number theory and cryptosystem : Diophantine linear equation |
| 13. Number theory and cryptosystem : Congruent expression |
| 14. Number theory and cryptosystem : Fermat’s little theorem |
| 15. Number theory and cryptosystem : The RSA cryptosystem |
|
|