582462 Advanced Course on Computer Security (ohtk 25.8.2011)
| Principal themes | Prerequisite knowledge | Approaches the learning objectives | Reaches the learning objectives | Deepens the learning objectives |
|---|---|---|---|---|
| Modular arithmetics |
Elementary mathematical proof technique. |
Can compute addition, multiplication and inverses in modular arithmetics. | Can construct pritmitive roots and finite fields. | Can write the Extended Euclid Algorithm and simulate it. |
| Key agreement protocols | Representation of algorithms in pseudo language. | Is able to enumerate the principles for design of cryptographic and public key protocols. | Can analyse and find holes in key agreement protocols presented in the course. | Can present and analyse the key agreement protocols presented in the course. |
| Group key agreement (changing part in the course) | Can simulate and analyse Burmester-Desmedt protocol versions. | Can simulate and analyse tree-based protocols. | Can present and analyse the group key agreement protocols presented in the course. | |
| Introduction to HIP. | Can analyse the security and trust aspects of the Base Exchange Protocol. | Can analyse the security and trust aspects of the Lightweight HIP. |
Printer-friendly version