See TUMonline

This module begins by reviewing mathematical fundamentals such as arithmetic on finite fields and operations on elliptic curves, and discusses the problems involved in implementing such algorithms in hardware. Building on this, algorithms for typical problems such as modulo addition, modulo multiplication (especially with regard to large numbers and special reduction polynomials), and inversion (finding the multiplicative inverse element) in finite fields are considered, and their efficient implementation and feasibility in hardware are discussed. In addition, potential points of attack on the discussed algorithms are discussed, and countermeasures are presented, including the general concept of side-channel analysis and fault injection attacks, as well as countermeasures (e.g., masking). Attacks on typical hardware components, such as scan chains or finite state machines, are also discussed.
Since high-quality random numbers also play a crucial role in secure implementations, the module also considers the implementation of physical and deterministic random number generators. Starting with linear feedback shift registers, their applications, and weaknesses, deterministic random number generators are first introduced before the concept of physical random number generators is developed, particularly using the case study of an oscillator-based random number generator. In this context, the statistical evaluation, modeling, and post-processing of randomness are also discussed.

- Digital Design
- VHDL or Verilog
- Good mathematical skills