MATHEMATICS (TURKISH, PHD) | |||||
PhD | TR-NQF-HE: Level 8 | QF-EHEA: Third Cycle | EQF-LLL: Level 8 |
Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
CYS5101 | Number Theory and Coding Theory for Cryptography | Fall | 3 | 0 | 3 | 12 |
The course opens with the approval of the Department at the beginning of each semester |
Language of instruction: | En |
Type of course: | Departmental Elective |
Course Level: | |
Mode of Delivery: | Face to face |
Course Coordinator : | Dr. Öğr. Üyesi AHMET NACİ ÜNAL |
Course Objectives: | To provide sufficient mathematical background to understand and analyze encryption/decryption algorithms. To teach secure methods for data storage, data sharing and data transferring. |
The students who have succeeded in this course; Gain a deep knowledge of old and modern encryption techniques. Be able to implement various types of public-key and private-key cryptosystems. Should be able make cryptanalysis of encryption techniques. Learn digital signature schemes. Be able implement secret sharing schemes. |
Introducing historical techniques of encryption and their cryptanalysis. Public key cryptography (RSA, ElGamal systems). The Data Encryption Standard (DES) and the Advanced Encryption Standard (AES). Signature schemes and key distribution. Secret sharing schemes and hash functions. Zero knowledge proofs. Elliptic curves arithmetic. Integer and modular arithmetic. |
Week | Subject | Related Preparation | |
1) | The fundamental principles of modern cryptography | Lecturer notes | |
2) | Basic Cihpers and their cryptanalysis | Lecturer notes | |
3) | Private-key Encryption and Pseudorandomness | Lecturer notes | |
4) | Public key cryptography (RSA, ElGamal etc) | Lecturer notes | |
5) | Cryptographic hardness assumptions (RSA problem, factoring integers, DLP) | Lecturer notes | |
6) | The Data Encryption Standard and the Advanced Encryption Standard | Lecturer notes | |
7) | Digital signature schemes | Lecturer notes | |
8) | Digital signature schemes | Lecturer notes | |
9) | Key distribution | Lecturer notes | |
10) | Secret sharing schemes | Lecturer notes | |
11) | Identity based encryption | Lecturer notes | |
12) | Zero-knowledge proofs | Lecturer notes | |
13) | Elliptic curves | Lecturer notes | |
14) | Integer arithmetic and modular arithmetic | Lecturer notes |
Course Notes: | 1. J. KATZ, Y. LINDELL, Introduction to Modern Cryptography: Principles and Protocols. 2007. 2. W. TRAPPE, L. WASHINGTON, Introduction to Cryptography with Coding Theory. |
References: | Ders Notları |
Semester Requirements | Number of Activities | Level of Contribution |
Attendance | 10 | % 0 |
Laboratory | 0 | % 0 |
Application | 0 | % 0 |
Field Work | 0 | % 0 |
Special Course Internship (Work Placement) | 0 | % 0 |
Quizzes | 0 | % 0 |
Homework Assignments | 4 | % 10 |
Presentation | 1 | % 10 |
Project | 0 | % 0 |
Seminar | 0 | % 0 |
Midterms | 1 | % 20 |
Preliminary Jury | 0 | % 0 |
Final | 1 | % 60 |
Paper Submission | 0 | % 0 |
Jury | 0 | % 0 |
Bütünleme | % 0 | |
Total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 40 | |
PERCENTAGE OF FINAL WORK | % 60 | |
Total | % 100 |
Activities | Number of Activities | Duration (Hours) | Workload |
Course Hours | 14 | 3 | 42 |
Laboratory | 0 | 0 | 0 |
Application | 0 | 0 | 0 |
Special Course Internship (Work Placement) | 0 | 0 | 0 |
Field Work | 0 | 0 | 0 |
Study Hours Out of Class | 14 | 12 | 168 |
Presentations / Seminar | 2 | 3 | 6 |
Project | 0 | 0 | 0 |
Homework Assignments | 4 | 8 | 32 |
Quizzes | 0 | 0 | 0 |
Preliminary Jury | 0 | 0 | 0 |
Midterms | 1 | 20 | 20 |
Paper Submission | 0 | 0 | 0 |
Jury | 0 | 0 | 0 |
Final | 1 | 20 | 20 |
Total Workload | 288 |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution |