Cryptography - university
Transcript of Cryptography - university
Cryptography and Network Security
Spring 2006
(M539)
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 differentialcryptanalysis, perfect secrecy, public-key cryptography (RSA, discrete logarithms), algorithms forfactoring and discrete logarithms, cryptographic protocols, hash functions, authentication, keymanagement, key exchange, signature schemes, email and web security, viruses, firewalls, and othertopics.
Content
I. CONVENTIONAL ENCRYPTION
Classical SystemsConventional Encryption: DES, AESContemporary Symmetric Ciphers: 3DES, RC4, RC5
II. PUBLIC-KEY ENCRYPTION
Introduction to Number TheoryPublic-Key Cryptography. RSAKey ManagementMessage Authentication and Hash FunctionsHash and Mac AlgorithmsDigital Signatures and Authentication Protocols
III. AUTHENTICATION
MACHash and message digestsDigital signaturesPasswordsKerberos
III. NETWORK SECURITY
Authentication ApplicationsElectronic Mail SecurityIP SecurityWeb Security
Lectures on Cryptography and Network Security http://users.abo.fi/ipetre/crypto/
1 of 4 02/07/2011 01:26 AM
IV. OTHER ISSUES
Intruders and VirusesFirewallsDigital cashSecret sharing schemesZero-knowledge techniquesFolklore
Literature
Text book: Stallings, W., Cryptography and Network Security. Principles and Practice, 3rdedition, Prentice Hall, 2002.Other sources, including:
Kaufman, C., Perlman, R., Speciner, M., Network security. Privatecommunication in a public worls, Prentice Hall, 2002.Trappe, W., Washingotn, L.C., Introduction to Cryptography with codingtheory, 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 AppliedCryptography, 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 andPractice, 3rd edition.
Student resources hereLecture 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 ofMay 2006.
The lectures are given every week on Tuesdays 14-16 and Thursdays 14-16, in room
Lectures on Cryptography and Network Security http://users.abo.fi/ipetre/crypto/
2 of 4 02/07/2011 01:26 AM
3102 DataCity A. Exam dates: May 22, 2006, June 5, 2006.
Prerequisites: Familiarity with computers, Internet, email, computer viruses andaverage-level mathematics. Advanced mathematics (including Number Theory andFinite Fields) will be introduced throughout the course whenever needed.
Registration (also for the exam): The participants to this course must register usingour Web-based system. Please follow instructions at https://www.cs.abo.fi/anmalan. You will be asked for the user name/password you normally use to login inyour home university servers (be it Abo Akademi or Turun Yliopisto).
Lecturer: Dr. Ion PETRE, Department of IT, Åbo Akademi University, http://www.abo.fi/~ipetre/.
Links:
Lecture notesLecture 1: IntroductionLecture 2: Classical encryptionLecture 3: Block ciphers. DESLecture 4: Finite fieldsLecture 5: AESLecture 6: 3DES, RC5, RC4, modes of operation for symmetric ciphersLecture 7: Public-key cryptography. RSALecture 8: Protocols for public-key managementLecture 9: Authentication protocols and digital signaturesLecture 10: Message authentication codes, hashes, HMACLecture 11: Email securityLecture 12: Web security, IP security, FirewallsLecture 13: Wireless security, Passwords, VirusesLecture 14: Practical tips, Summary of the course
Assignments: The assignments are optional. Each of them offers a number bonus pointsthat will be awarded to the first N students to email the correct solution (N to be specifiedfor each assignment).
Assignments 1,2: Caesar (2 challenges)Assignment 3: Variant of CaesarAssignment 4: Monoalphabetic cipherAssignment 5: Variant of VigenereAssignment 6 : DES with weak keyAssignment 7: DES with medium keyAssignment 8: Birthday attack on a hash functionMain challenge of the course: RC4 with 128-bit key (16 bytes)
Lectures on Cryptography and Network Security http://users.abo.fi/ipetre/crypto/
3 of 4 02/07/2011 01:26 AM
Validation tests for RC4
Bonus points listExam results here (exam of 22.05.2006, 5.06.2006)
Back to Ion Petre's homepage.
Last updated: June, 2006.
Lectures on Cryptography and Network Security http://users.abo.fi/ipetre/crypto/
4 of 4 02/07/2011 01:26 AM