Turnus of offer:
every summer semester
Course of studies, specific field and terms:
- Master Entrepreneurship in Digital Technologies 2020 (advanced module), technology field computer science, Arbitrary semester
- Master Robotics and Autonomous Systems 2019 (optional subject), Additionally recognized elective module, Arbitrary semester
- Master Computer Science 2019 (optional subject), Elective, Arbitrary semester
- Master IT-Security 2019 (optional subject), IT Security and Privacy, 1st, 2nd, or 3rd semester
Classes and lectures:
- Cryptographic Engineering (exercise, 2 SWS)
- Cryptographic Engineering (lecture, 2 SWS)
- 60 Hours in-classroom work
- 100 Hours private studies
- 20 Hours exam preparation
Contents of teaching:
- Efficient Implementation of Finite Field Arithmetic for cryptographic Applications.
- Stream Ciphers: Design and hardware Implementation.
- Block Ciphers: Design, hardware Implementation, and Lightweight Encryption Algorithms.
- Hash Functions: Design and hardware Implementation.
- Public-Key Cryptography over GF(2m): Design and Implementation.
- True and Pseudo Random Number Generators (TRNG): Design, test, and hardware Implementation.
- Physical Unclonable Functions (PUFs): Design Challenges and Hardware- Architectures.
- Students will become familiar with the concept of cryptographic engineering and the associated topics with it.
- They can expand and enhance their knowledge about a cryptography and applied cryptography.
- They can become more familiar with the concepts of hardware-security.
- They can learn efficient implementation of Finite Field Arithmetic in hardware and its applications in cryptography.
- They can learn the techniques for hardware-implementation of cryptographic algorithms
- They can demonstrate a deep understanding of several structures and designs of stream and block ciphers
- They can take an advanced step towards hardware and physical security such as TRNG, PUFs.
Responsible for this module:
- Ferguson, Niels, Bruce Schneier, and Tadayoshi Kohno: Cryptography Engineering: Design Principles and Practical Applications - 2012
- Koç Ç.K.: Cryptographic Engineering - Springer, Boston, MA, (2009)
- Wachsmann, Christian, and Ahmad-Reza Sadeghi: Physically unclonable functions (PUFs): Applications, models, and future directions - Morgan & Claypool Publishers, 2014
- Johnston, David: Random Number GeneratorsPrinciples and Practices: A Guide for Engineers and Programmers - Walter de Gruyter GmbH & Co KG, 2018
Admission requirements for taking the module:
Admission requirements for participation in module examination(s):
- Successful completion of exercises as specified at the beginning of the semester.
- CS4705-L1: Cryptographic Technology, written exam, 90min, 100% of module grade.
Letzte Änderung: 24.4.2023