Nevşehir Hacı Bektaş Veli University Course Catalogue

Information Of Programmes

INSTITUTE OF SCIENCE / MAT519 - MATHEMATICS

Code: MAT519 Course Title: CRYPTOLOGY I Theoretical+Practice: 3+0 ECTS: 6
Year/Semester of Study 1 / Fall Semester
Level of Course 2nd Cycle Degree Programme
Type of Course Optional
Department MATHEMATICS
Pre-requisities and Co-requisites None
Mode of Delivery Face to Face
Teaching Period 14 Weeks
Name of Lecturer HAYRULLAH ÖZİMAMOĞLU (h.ozimamoglu@nevsehir.edu.tr)
Name of Lecturer(s)
Language of Instruction Turkish
Work Placement(s) None
Objectives of the Course
To give information about classical cryptosystems and show the significant of their application areas to students.

Learning Outcomes PO MME
The students who succeeded in this course:
LO-1 Can learn basic encoding methods. PO-1 Fundamental theorems of about some sub-theories of Analysis, Applied Mathematics, Geometry, and Algebra can apply to new problems.
Examination
LO-2 Can perceive classical cryptosystems and attacks against these systems. PO-2 Ability to assimilate mathematic related concepts and associate these concepts with each other.
PO-3 Mathematics, natural sciences and their branches in these areas and related issues has sufficient infrastructure solutions for the problems of theoretical and practical uses of mathematics.
Examination
LO-3 Can know the encryption standards (DES,AES). Can learn the basic building of the RSA algorithm and perceive what their difficulties are based on. PO-2 Ability to assimilate mathematic related concepts and associate these concepts with each other.
PO-11 Ability to make individual and team work on issues related to working and social life.
Examination
PO: Programme Outcomes
MME:Method of measurement & Evaluation

Course Contents
Introduction to cryptography, Classical cryptosystems ( Sezar, Affine), Classical cryptosystems (Vigenere, Permutation), Block cryptosystems (Hill), The data encryption standart (DES), The advanced encryption standart (AES), Public key cryptosystems (RSA), Primality testing, Factorization algorithms
Weekly Course Content
Week Subject Learning Activities and Teaching Methods
1 Introduction to crytography Lecturing
2 Classical cryptosystems ( Sezar, Affine) Lecturing
3 Classical cryptosystems (Vigenere, Permutation) Lecturing
4 Block cryptosystems (Hill) Lecturing
5 Cryptoanalysis Lecturing
6 The data encryption standart (DES) Lecturing
7 The data encryption standart (DES) Lecturing
8 mid-term exam
9 The advanced encryption standart (AES) Lecturing
10 The advanced encryption standart (AES) Lecturing
11 Public key cryptosystems (RSA) Lecturing
12 Public key cryptosystems (RSA) Lecturing
13 Primality testing Lecturing
14 Primality testing Lecturing
15 Factorization algorithms Lecturing
16 final exam
Recommend Course Book / Supplementary Book/Reading
1 Wade Trappe, Lawrence C. Washington, Introduction to Cryptography with Coding Theory, second ed., Pearson Education, 2007.
2 Douglas Stinson, "Cryptography: Theory and Practice", CRC Press, 2002.
3 Johannes Buchmann, "Introduction to Cryptography", Springer-Verlag, New York, 2001.
4 Cryptography and Network Security: Principles and Practice, 5/E William Stallings, Prentice Hall 2011.
Required Course instruments and materials

Assessment Methods
Type of Assessment Week Hours Weight(%)
mid-term exam 8 2 40
Other assessment methods
1.Oral Examination
2.Quiz
3.Laboratory exam
4.Presentation
5.Report
6.Workshop
7.Performance Project
8.Term Paper
9.Project
final exam 16 2 60

Student Work Load
Type of Work Weekly Hours Number of Weeks Work Load
Weekly Course Hours (Theoretical+Practice) 3 14 42
Outside Class
       a) Reading 5 14 70
       b) Search in internet/Library 2 14 28
       c) Performance Project 0
       d) Prepare a workshop/Presentation/Report 0
       e) Term paper/Project 0
Oral Examination 0
Quiz 0
Laboratory exam 0
Own study for mid-term exam 4 4 16
mid-term exam 2 1 2
Own study for final exam 5 4 20
final exam 2 1 2
0
0
Total work load; 180