Return to Teaching

2017 – Cryptography and Network Security

SPRING 2017

Description

We cover in this course principles and practice of cryptography and network security: classical systems, symmetric block ciphers (DES, AES, other contemporary symmetric ciphers), linear and differential cryptanalysis, perfect secrecy, public-key cryptography  (RSA, discrete logarithms), algorithms for factoring and discrete logarithms, cryptographic protocols, hash functions, authentication, key management, key exchange, signature schemes, email and web security, viruses, firewalls, and other topics.

Content

  1. CONVENTIONAL ENCRYPTION
    • Classical Systems
    • Conventional Encryption: DES, AES
    • Contemporary Symmetric Ciphers: 3DES, RC4, RC5
  2. PUBLIC-KEY ENCRYPTION
    • Introduction to Number Theory
    • Public-Key Cryptography. RSA
    • Key Management
    • Message Authentication and Hash Functions
    • Hash and Mac Algorithms
    • Digital Signatures and Authentication Protocols
  3. AUTHENTICATION
    • MAC
    • Hash and message digests
    • Digital signatures
    • Passwords
    • Kerberos
  4. NETWORK SECURITY
    • Authentication Applications
    • Electronic Mail Security
    • IP Security
    • Web Security
  5. OTHER ISSUES
    • Intruders and Viruses
    • Firewalls
    • Digital cash
    • Secret sharing schemes
    • Zero-knowledge techniques
    • Folklore

Literature

  • Text book: Stallings, W., Cryptography and Network Security. Principles and Practice, 5th edition, Prentice Hall, 2011.
  • Other sources, including: Network Security. Private communication in a public worls, Prentice Hall, 2002.
  • Trappe, W., Washingotn, L.C., Introduction to Cryptography with coding theory, Pearson-Prentice Hall, 2006.
  • Tanenbaum, A.S., Computer Networks, 4th edition, Prentice Hall, 2003.
  • Stinson, D., Cryptography. Theory and Practice, 2nd edition, CRC Press, 2002.
  • Menezes, A., van Oorschot, P., Vanstone, S., Handbook of Applied Cryptography, CRC Press, 1997.
  • Salomaa, A., Public-Key Cryptography, 2nd edition, Springer-Verlag, 1996.
  • Papadimitriou, C., Computational Complexity, Addison-Wesley, 1995.
  • Koblitz, N., A Course in Number Theory and Cryptography, 2nd edition, Springer 1994.
  • Bach, E., Shallit, J., Algorithmic Number Theory, Vol. I: Efficient Algorithms, 2nd printing, MIT Press, 1997.

Online resources

Credits

5 sp

Components

28h lectures, optional projects, final exam.

Time and place

  • Start date: 9th of January, 2017
  • End date: 21st of February, 2017
  • Mondays:
    • 10-12, K124B
  • Tuesdays:
    • 13-15, K124B
  • Exams:
    • 24.03.2017
    • 21.04.2017
    • 05.05.2017

Prerequisites

The courses on “Programmering (grundkurs)”, “Programmering (fortsättningskurs)”, “Praktikum i programmering”, “Datastrukturer”, “Algoritmer”. Familiarity with computers, Internet, email, computer viruses and average-level mathematics. Advanced mathematics (including elements of number theory and finite fields) will be introduced throughout the course whenever needed.

Registration (also for the exam)

Through MinPlan.

Lecturer

Dr. Vladimir Rogojin (vrogojin at abo.fi, room B5078, ICT-house)

Department of IT, Åbo Akademi University.

Lecture slides and recommended reading

  • W. Stallings – Stallings, W., Cryptography and Network Security. Principles and Practice, 6th edition, Prentice Hall, 2013
  • W. Stallings, L. Brown,  Computer Security. Principles and Practice, 2nd edition, Pearson Education Ltd., 2012
  • Ch. Kaufman, R. Perlman, R. Speciner, Network Security. Private communication in a public worls, Prentice Hall, 2002.