Circuit Design for Security

What it is about

You learn how cryptographic algorithms (e.g., arithmetic in finite fields and operations on elliptic curves) are implemented efficiently and securely in hardware. You also recognize typical attack vectors (side-channel, fault injection, scan-chain, and FSM attacks) and countermeasures, as well as the structure and evaluation of real and deterministic random number generators.

What you will be able to do

• Implement mathematical concepts of cryptography in hardware
• Assess suitability and efficiency of implementation algorithms
• Assess side-channel and fault-injection attacks as well as typical vulnerabilities
• Name countermeasures for hardware security
• Outline the construction and concepts of real and deterministic random number generators
• Apply evaluation criteria for random number generators

What the module consists of

• VorlesungConveying theoretical foundations (mathematics, algorithms) and interactive discussions on implementation concepts and attack scenarios
• ZentralübungDiscussion of prepared tasks for deepening and analysis of typical problem situations
• Praktikum / ImplementierungsaufgabenIndependent practical implementation, synthesis, and simulation of secure hardware components
• Moodle-ForumSupport from instructors on content and practical tasks

Teaching method

• FrontalunterrichtIntroduction to theoretical concepts and algorithms
• Interaktive DiskussionenDevelopment of implementation concepts, analysis and promotion of analytical skills
• Selbstständige Aufgaben / ZentralübungDeepening understanding and training on typical questions of secure circuit design
• Praktische ImplementierungsaufgabenLearning practical implementation, synthesis and simulation of circuits