Course Description

　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.
　

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

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