Introduction to Cryptology(INF441)
| Course Code | Course Name | Semester | Theory | Practice | Lab | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| INF441 | Introduction to Cryptology | 8 | 3 | 0 | 0 | 3 | 4 |
| Prerequisites | INF315 |
| Admission Requirements | INF315 |
| Language of Instruction | Turkish |
| Course Type | Elective |
| Course Level | Bachelor Degree |
| Course Instructor(s) | MURAT AKIN murakin@gsu.edu.tr (Email) |
| Assistant | |
| Objective |
Although cryptography is a very old science, it has recently undergone a real revolution. Techniques from arithmetic helped to construct so-called unidirectional properties. For example, while it is very easy to encrypt for anyone who knows the public key, it has become impossible to decrypt for those who do not know the private key. Modern encryption is used to secure access to computers, e-commerce systems, banking transactions, even to authenticate a digital document or for electronic voting. In this context, the objectives of this course can be listed as follows: - Teaching the main algorithms used in public key cryptosystems: "greedy" algorithms, Euclid algorithm and fast computation algorithms in modulo n strength - Proof of major arithmetic theorems used in public key systems - Application of theorems to Merkle-Hellman, RSA and El Gamal cryptosystems - Explaining the security-based features of the systems - Demonstration of how encryption systems are also used in authentication systems - Introducing the old (Ceaser, Vigenère, ...) and Modern (one-time password, Hill encryption) secret key encryption systems to the student - Presenting different block cipher systems. |
| Content |
Week 1 Glouton algorithm, applications in cryptography Week 2 Euclide's algorithm and mod n application Week 3 Lagrange and Fermat theorems, fast and modular computation applications Week 4 RSA encryption system Week 5 Block RSA encryption Week 6 Discrete logarithm problem Week 7 Diffie-Hellman key exchange method Week 8 Midterm Exam Week 9 El Gamal encryption system Week 10 Electronic signature, signature and hash functions Week 11 César, Vigénère, etc. classical encryption methods such as Week 12 Hill encryption Week 13 Principles and working mechanisms of block ciphers Week 14 Feistel chart |
| Course Learning Outcomes |
The student who will successfully complete this course will develop the following skills and have the following skills: 1. The ability to apply the "greedy" algorithm to Merkle-Hellman encryption and to apply the Euclid algorithm to the inverse of the modulo algorithm, 2. Ability to apply fast computation algorithm in modulo n strength and generate valid public/private key pair for RSA encryption system, 3. Ability to use the given public RSA key to encrypt words of any length and to generate a valid public/private key pair used for the El Gamal encryption system, 4. The ability to use the El Gamal public key to generate a private key or encrypt a message and use the hash function to authenticate a message, 5. The ability of a French word to encrypt with various secret key encryption systems and to generate and use a valid secret key for Hill encryption, 6. Ability to encrypt a binary word with various block cipher systems |
| Teaching and Learning Methods | |
| References |
1.Ders Notları: http://uni.gsu.edu.tr/moodle/course/view.php?id=53 2. Cours de cryptographie, Gilles Zémor, Cassini. ISBN 2-84225-020-6 |
Theory Topics
| Week | Weekly Contents |
|---|
Practice Topics
| Week | Weekly Contents |
|---|
Contribution to Overall Grade
| Number | Contribution | |
|---|---|---|
| Toplam | 0 | 0 |
In-Term Studies
| Number | Contribution | |
|---|---|---|
| Toplam | 0 | 0 |
| No | Program Learning Outcomes | Contribution | ||||
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| Activities | Number | Period | Total Workload |
|---|---|---|---|
| Total Workload | 0 | ||
| Total Workload / 25 | 0,00 | ||
| Credits ECTS | 0 | ||