MML1013 | Modular Arithmetic and Cryptography |
Teaching Staff in Charge |
Assoc.Prof. CRIVEI Septimiu, Ph.D., criveimath.ubbcluj.ro |
Aims |
Presentation of basic elements of modular arithmetic. Presentation of fundamental encryption algorithms with private and public keys and applications. |
Content |
1. Algorithms complexity. Modular arithmetic.
2. Primality and factorization. 3. Finite fields and discrete logarithms. 4. Classical encryption systems. 5. Private key cryptography. 6. Public key cryptography. 7. Hash functions and digital signatures. 8. Protocols on keys. |
References |
1. S. Crivei, A. Marcus, C. Sacarea, C. Szanto, Computational algebra with applications to coding theory and cryptography, Ed. EFES, Cluj-Napoca, 2006.
2. C. Gherghe, D. Popescu, Criptografie. Coduri. Algoritmi, Univ. Bucuresti, 2005. 3. D. Kahn, The Codebreakers, Macmillan, 1967. 4. N. Koblitz, A Course in Number Theory and Cryptography, Springer, 1994. 5. A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997. [http://www.cacr.math.uwaterloo.ca/hac] |
Assessment |
Presentation and project (2/3 of the grade), laboratories (1/3 of the grade). |
Links: | Syllabus for all subjects Romanian version for this subject Rtf format for this subject |