MAC functions map a variable-length message to fixed-length tag. Often they consist of two phases: a compression phase that maps the input to a compact secret state and a scrambling phase that computes a tag from that state. The compression phase, also known as keyed hashing, should have the following property: for an adversary that does not know the secret key, it is hard to generate collisions. In this thesis we will explore building efficient secure keyed hash functions specified in terms of the dedicated AES instructions available on many CPUs.The type of work includes pen-and-paper analysis, writing and running code and making use of tools such as SAT solvers and mixed integer linear programming (MILP) for experiments and interpretation of their results.
If you are interested in this topic, please send an email to Joan Daemen via joan@cs.ru.nl .