The course Schedule includes the mathematical theories, and tools which are important for the cryptography such as the divisibility, prime numbers, congruencies, arithmetic with large integers, polynomial arithmetic, random numbers etc.

Course Objectives

To prepare the students for cryptography courses. (1,3) To develop skills to understand the divisibility, prime numbers, congruencies, arithmetic with large integers, polynomial arithmetic, random numbers, and related theories .

Recommended or Required Reading

J. H. Silverman, A Friendly Introduction to Number Theory , Second Edition ,Shoup, A Computational Introduction to Number Theory and Algebra , Version 2, E-Book, http://shoup.net/ntb ,N. Koblitz, A Course in Number Theory and Cryptography , Second Edition ,D. Bressoud and S. Wagon, A Course in Computational Number Theory ,D. E. Knuth, The Art of Computer Programming , volume 2, Second edition, 1981

Learning Outcomes

1. To be able to recognize and implement of the mathematical concepts of behind the cryptographic applications.

2. To be able to employ the coding of computational number theorical components and algorithms.

3. To be able to compare of different mathematical structures according to requirements of cryptosystems.

4. To be able to analyze the mathematical structers of symmetrical and asymmetrical cryptosystems.

Grading

Midterm: 30%

Presentation: 40%

Final: 30%