"Babes-Bolyai" University of Cluj-Napoca
Faculty of Mathematics and Computer Science

Criptography
Code
Semes-
ter
Hours: C+S+L
Credits
Type
Section
MA024
8
2+2+0
7.5
optional
Matematică
MA024
8
2+2+0
10
optional
Informatică
MA024
8
2+2+0
7.5
optional
Matematică-Informatică
Teaching Staff in Charge
Prof. MARCUS Andrei, Ph.D., marcus@math.ubbcluj.ro
Lect. SACAREA Cristian, Ph.D., csacarea@math.ubbcluj.ro
Aims
We present the most important algorithms for cryptography with private keys (DES, AES) and public keys (RSA, DSS), and also several protocols.
Content
Modular arithmetic. Congruences. Modular exponentiation. Quadratic residues. Classical cryptosystems. Complexity of algorithms. Private key cryptosystems: DES, AES. Public key cryptosystems. One-way and trapdoor functions. Digital signature. Factorization and primality tests. RSA. Finite fields and the discrete logarithm. Diffie-Hellman key exchange. Digital Signature Standard.
References
1. Arto Salomaa - Criptografie cu chei publice, Ed. Militara Bucuresti 1983.
2. N.Koblitz - A Course in Number Theory and Cryptography, Springer-Verlag 1994.
3. R.Lidl,G.Pilz - Applied Abstract Algebra, Springer-Verlag 1998.
Assessment
Exam.