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, publickey 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
 CONVENTIONAL ENCRYPTION
 Classical Systems
 Conventional Encryption: DES, AES
 Contemporary Symmetric Ciphers: 3DES, RC4, RC5
 PUBLICKEY ENCRYPTION
 Introduction to Number Theory
 PublicKey Cryptography. RSA
 Key Management
 Message Authentication and Hash Functions
 Hash and Mac Algorithms
 Digital Signatures and Authentication Protocols
 AUTHENTICATION
 MAC
 Hash and message digests
 Digital signatures
 Passwords
 Kerberos
 NETWORK SECURITY
 Authentication Applications
 Electronic Mail Security
 IP Security
 Web Security
 OTHER ISSUES
 Intruders and Viruses
 Firewalls
 Digital cash
 Secret sharing schemes
 Zeroknowledge 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, PearsonPrentice 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., PublicKey Cryptography, 2nd edition, SpringerVerlag, 1996.
 Papadimitriou, C., Computational Complexity, AddisonWesley, 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
 Online resources of Stallings’s Cryptography and Network Security. Principles and Practice, 5th edition.
 Online resources of Tanenbaum’s Computer Networks 4th edition.
 Online resources of Menez, van Oorschot, Vanstone’s Handbook of Applied Cryptography (all chapters available online).
 Previous course page
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:
 1012, K124B
 Tuesdays:
 1315, K124B
 Exams:
 24.03.2017
 21.04.2017
 05.05.2017
 January 9, 2017


January 9, 2017: Lecture 1: Introduction

 January 10, 2017


January 10, 2017: Lecture 2: Classical encryption

 January 16, 2017


January 16, 2017: Lecture 3: Block ciphers and DES

 January 17, 2017


January 17, 2017: Lecture 4: Block cipher operation, RC5, RC4

 January 23, 2017


January 23, 2017: Lecture 5: Basic notions of finite fields

 January 24, 2017


January 24, 2017: Lecture 6: Advanced Encryption Standard (AES)

 January 30, 2017


January 30, 2017: Lecture 7: Publickey cryptography and RSA

 January 31, 2017


January 31, 2017: Lecture 8: Protocols for publickey management1:30 pm  3:00 pm, K124B, Agora,

 February 6, 2017


February 6, 2017: Lecture 9: Authentication protocols, digital signatures

 February 7, 2017


February 7, 2017: Lecture 10: Message authentication: MAC, hashes, MD5, SHA1, HMAC

 February 13, 2017


February 13, 2017: Lecture 11: Email security: PGP and S/MIME

 February 14, 2017


February 14, 2017: Lecture 12: Web security, IP security, Firewalls

 February 20, 2017


February 20, 2017: Lecture 13: Wireless security, Password management, Viruses

 February 21, 2017


February 21, 2017: Lecture 14: Digital money

Prerequisites
The courses on “Programmering (grundkurs)”, “Programmering (fortsättningskurs)”, “Praktikum i programmering”, “Datastrukturer”, “Algoritmer”. Familiarity with computers, Internet, email, computer viruses and averagelevel 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, ICThouse)
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.