Course details

Cryptography

KRY Acad. year 2008/2009 Summer semester 5 credits

Current academic year

Introduction to cryptography, basic cryptographic algorithms, secret key encryption, public key encryption. Data transmission security.

Guarantor

Hanáček Petr, doc. Dr. Ing. (DITS)

Language of instruction

Czech

Completion

Examination

Time span

  • 26 hrs lectures
  • 13 hrs projects

Department

Department of Intelligent Systems (UITS)

Lecturer

Hanáček Petr, doc. Dr. Ing. (DITS)

Instructor

Pecho Peter, Ing., Ph.D.
Schäfer Jiří, Ing.

Subject specific learning outcomes and competences

Students will learn basic principles of applied cryptography, including classical cryptography and modern secret key and public key cryptography.

Students will learn the role of security and functionality in information systems.

Learning objectives

The goal is to make students familiar with the basic concepts applied cryptography, including classical cryptography and modern secret key and public key cryptography.

Prerequisite knowledge and skills

There are no prerequisites

Study literature

  • Hanáček, P., Staudek, J.: Bezpečnost informačních systémů, ÚSIS, Praha, 2000, s. 127, ISBN80-238-5400-3
  • Savard, J. J. G.: A Cryptographic Compendium, 2000, available on WWW
  • Nechvatal, J.: PUBLIC-KEY CRYPTOGRAPHY, NIST Special Publication 800-2, National Institute of Standards and Technology, Gaithersburg, MD 20899, 1991, available on WWW
  • Menezes, Van Oorschot, Vanstone: Handbook of Applied Cryptography, CRC Press Series on Discrete Mathematics and Its Applications, Hardcover, 816 pages, CRC Press, 1997, available on WWW

Fundamental literature

  • Menezes, Van Oorschot, Vanstone: Handbook of Applied Cryptography, CRC Press Series on Discrete Mathematics and Its Applications, Hardcover, 816 pages, CRC Press, 1997.
  • Stallings, W.: Cryptography and Network Security, Prentice Hall, 1999, ISBN 0-13-869017-0

Syllabus of lectures

  • Classical cryptography.
  • Modern cryptography, symetric and asymetric ciphers.
  • Symetric ciphers. Key length, brute force attack.
  • Examples of symetric ciphers. Feistel, DES, modes of operation.
  • Typical application of symetric cryptography.
  • Asymetric cryptography.
  • Electronic signature.
  • Examples of asymteric ciphers, RSA.
  • DSS, function, attacks, optimization.
  • ElGamal, keyed hash, MAC.
  • Asymetric cryptography application examples.
  • Key management for symetric cryptography.
  • Key management for asymetric cryptography, certificates, X.509.

Progress assessment

Study evaluation is based on marks obtained for specified items. Minimimum number of marks to pass is 50.

Teaching methods and criteria

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Controlled instruction

There are no checked study.

Course inclusion in study plans

Back to top