Prof. Dr. Kai-Uwe Schmidt

In this talk I consider functionals on a vector space over a finite field, including Boolean functions. The main question I address is: How far can such functions be away from the set of linear functions. This question is of vital importance in cryptography and is in disguise an old puzzle in coding theory. I shall explain the history of this problem and then explain how probabilistic and number-theoretic methods can be used to show that there are indeed functions with maximum possible distance to the set of linear functions.

Datum: 04.07.2019, Raum: G03-106, Zeit: 17:00

Letzte Änderung: 17.06.2019 - Ansprechpartner: Prof. Dr. Volker Kaibel