Optimal Cryptographic Functions
Trial lecture in connection with recruitment for Professor position in information security Lilya Budaghyan.
Optimal cryptographic functions are discrete functions (usually Boolean functions) with optional cryptographic properties. Such functions are universal, in a sense that they define optimal objects not only in cryptography but also in many other domains of mathematics and information theory. On the other hand, in most cases these functions are difficult to study or construct, and currently just a few classes of these functions are known. In this talk we discuss properties and classifications problem of these optimal functions.