###
Finite Structures in Cryptology

A Talk by Enes Pasalic

Tuesday 29th Jan 2013, 4:00 PM

Venue: BIRU Seminar Room

###
Abstract

Many cryptographic primitives use suitable discrete structures, which is directly related to the fact that the world of digits and its applications employs a binary alphabet. In general, any such application can be represented as a bunch of inputs that provides you with a bunch of binary outputs, and such a discrete structure is known as multiple Boolean functions. Nevertheless, there are other interesting objects that reside in the theory of finite fields, such as planar and complete mappings, and these are closely related to certain combinatorial objects known as bent functions (and its various generalized concepts). The purpose of this talk is to give a deeper insight in some interesting relations between these different discrete structures and their strong interplay.

DOWNLOAD PDF