Cryptographic Hash Functions (Problem Session)

Lecturer: Prof Stefan Lucks

Class Meeting: Thursdays, 11:00 - 12:30 (Bauhausstraße 11 (B11), SR 013)

biweekly (first meeting: April 04 2019)

Target audience:

Computer Science and Media, M.Sc., Computer Science for Digital Media, M.Sc., Human-Computer Interaction, M.Sc.

Problem Sets:


Additional Material:

  • The Hitchhiker’s Guide to the SHA-3 Competition (Orr Dunkelmann)

Remark: The problem sets usually appear little less than two weeks before the corresponding problem session.
                A problem set is satisfiable solved when at least 25% are reached.
                A problem set is successfully solved when at least 50% are reached.

To gain admission for the oral exam, one of the following conditions have to be accomplished:

  1. Every problem set is satisfiable solved.
  2. All but one problem sets are satisfiable solved and at least two problem sets are successfully solved.

It is allowed to work in groups up to three students. We highly recommend to work in groups.

Final Grade-Bonus:

- A bonus of 1/3 is gained when all problem sets are satisfiable solved and at least three of them are successfully solved.
- A bonus of 2/3 is gained when at most one problem set is only satisfiable solved and all others are successfully solved.

The bonus can only be used to improve the final grade of the exam, when the exam itself is passed.