Sunteți pe pagina 1din 4

Lectures on Cryptography and Network Security http://users.abo.


Cryptography and Network Security

Spring 2006


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



Classical Systems
Conventional Encryption: DES, AES
Contemporary Symmetric Ciphers: 3DES, RC4, RC5


Introduction to Number Theory

Public-Key Cryptography. RSA
Key Management
Message Authentication and Hash Functions
Hash and Mac Algorithms
Digital Signatures and Authentication Protocols


Hash and message digests
Digital signatures


Authentication Applications
Electronic Mail Security
IP Security
Web Security

1 of 4 02/07/2011 01:26 AM
Lectures on Cryptography and Network Security


Intruders and Viruses

Digital cash
Secret sharing schemes
Zero-knowledge techniques


Text book: Stallings, W., Cryptography and Network Security. Principles and Practice, 3rd
edition, Prentice Hall, 2002.
Other sources, including:

Kaufman, C., Perlman, R., Speciner, M., 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:
Online resources of Stallings's Cryptography and Network Security. Principles and
Practice, 3rd edition.
Student resources here
Lecture handouts available here
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).

Credits: 3 CU.

Components: 28h lectures.

Time schedule: The course starts on March 21, 2006 and ends in the beginning of
May 2006.
The lectures are given every week on Tuesdays 14-16 and Thursdays 14-16, in room

2 of 4 02/07/2011 01:26 AM
Lectures on Cryptography and Network Security

3102 DataCity A.
Exam dates: May 22, 2006, June 5, 2006.

Prerequisites: Familiarity with computers, Internet, email, computer viruses and

average-level mathematics. Advanced mathematics (including Number Theory and
Finite Fields) will be introduced throughout the course whenever needed.

Registration (also for the exam): The participants to this course must register using
our Web-based system. Please follow instructions at
/anmalan. You will be asked for the user name/password you normally use to login in
your home university servers (be it Abo Akademi or Turun Yliopisto).

Lecturer: Dr. Ion PETRE, Department of IT, Åbo Akademi University,

Lecture notes
Lecture 1: Introduction
Lecture 2: Classical encryption
Lecture 3: Block ciphers. DES
Lecture 4: Finite fields
Lecture 5: AES
Lecture 6: 3DES, RC5, RC4, modes of operation for symmetric ciphers
Lecture 7: Public-key cryptography. RSA
Lecture 8: Protocols for public-key management
Lecture 9: Authentication protocols and digital signatures
Lecture 10: Message authentication codes, hashes, HMAC
Lecture 11: Email security
Lecture 12: Web security, IP security, Firewalls
Lecture 13: Wireless security, Passwords, Viruses
Lecture 14: Practical tips, Summary of the course

Assignments: The assignments are optional. Each of them offers a number bonus points
that will be awarded to the first N students to email the correct solution (N to be specified
for each assignment).
Assignments 1,2: Caesar (2 challenges)
Assignment 3: Variant of Caesar
Assignment 4: Monoalphabetic cipher
Assignment 5: Variant of Vigenere
Assignment 6 : DES with weak key
Assignment 7: DES with medium key
Assignment 8: Birthday attack on a hash function
Main challenge of the course: RC4 with 128-bit key (16 bytes)

3 of 4 02/07/2011 01:26 AM
Lectures on Cryptography and Network Security

Validation tests for RC4

Bonus points list

Exam results here (exam of 22.05.2006, 5.06.2006)

Back to Ion Petre's homepage.

Last updated: June, 2006.

4 of 4 02/07/2011 01:26 AM