| Learning Outcomes |
PO |
MME |
| The students who succeeded in this course: |
|
|
| LO-1 |
Can learn basic encoding methods. |
PO-1 Have the ability to conceptualize the events and facts related to the field of mathematics such as Analysis, Geometry and Algebra with the help of the scientific methods and techniques and can define these concepts.
|
Examination
|
| LO-2 |
Can perceive classical cryptosystems and attacks against these systems. |
PO-2 Have the knowledge to critize, analyze, and evaluate the correctness, reliability, and validity of mathematical data.
PO-3 Define the some models of mathematical problems, evaluate with a critical approach, analyze with theoretical and applied knowledge.
|
Examination
|
| LO-3 |
Can learn the basic building of open-key cryptosystems and perceive what their difficulties are based on. |
PO-2 Have the knowledge to critize, analyze, and evaluate the correctness, reliability, and validity of mathematical data.
PO-3 Define the some models of mathematical problems, evaluate with a critical approach, analyze with theoretical and applied knowledge.
PO-11 With the knowledge he gain, they determine the learning needs of those working under him, execute the musts of graduate education.
|
Examination
|
PO: Programme Outcomes
MME:Method of measurement & Evaluation |
| Course Contents |
| Encryption systems, cryptoanalysis, classical cryptosystems ( Sezar, Affine, Vigenere, Permutation), block cryptosystems (Hill), pre-informations about the number theory, public key cryptosystems (RSA, El-Gamal), primality tests, factorization algorithms, discrete logarithms, Diffie-Hellman key exchange, digital signatures |
| Weekly Course Content |
| Week |
Subject |
Learning Activities and Teaching Methods |
| 1 |
Encryption systems
|
Lecturing |
| 2 |
Cryptoanalysis
|
Lecturing |
| 3 |
Classical cryptosystems ( Sezar, Affine)
|
Lecturing |
| 4 |
Classical cryptosystems (Vigenere)
|
Lecturing |
| 5 |
Classical cryptosystems (Permutation)
|
Lecturing |
| 6 |
Block cryptosystems (Hill)
|
Lecturing |
| 7 |
Pre-informations about the number theory
|
Lecturing |
| 8 |
mid-term exam |
|
| 9 |
Public key cryptosystems (RSA)
|
Lecturing |
| 10 |
Primality tests
|
Lecturing |
| 11 |
Factorization algorithms
|
Lecturing |
| 12 |
Discrete logarithms
|
Lecturing |
| 13 |
Diffie-Hellman key exchange
|
Lecturing |
| 14 |
Public key cryptosystems (El-Gamal)
|
Lecturing |
| 15 |
Digital signatures |
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 |
Johannes Buchmann, "Introduction to Cryptography", Springer-Verlag, New York, 2001. |
| 3 |
Douglas Stinson, "Cryptography: Theory and Practice", CRC Press, 2002. |
| 4 |
Cryptography and Network Security: Principles and Practice, 5/E William Stallings, Prentice Hall 2011. |
| Required Course instruments and materials |
| Lecture books |
