Problem Session Cryptographic Hash Functions

Lecturer: Jakob Wenzel

Class Meeting:

Every two weeks (starting 8th of April), 15:15-16:45, Haußknechtstr. 7 (HK7), Lecture Room

Target audience:

Computer Science and Media, M.Sc.

Problem Sets:

  • 1. Problem Set (due 8th April 2014 in the problem session)
  • 2. Problem Set (due 22nd April 2014 in the problem session; the programming task due to 21st April via E-Mail)
  • 3. Problem Set (due 06th May 2014 in the problem session; the programming task due to 05th May via E-Mail)
  • 4. Problem Set (due 20th May 2014 in the problem session)
  • 5. Problem Set (due 3rd June 2014 in the problem session) -- Example Solution
  • 6. Problem Set (due 17th June 2014 in the problem session; the programming task due to 16th June via E-Mail)
  • 7. Problem Set (due 08th July 2014 in the problem session; the programming task due to 07th July via E-Mail)

Additional Material:

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

Remark: The problem sets appear usually one week 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.