School Seminars and Colloquia

Classifying bent functions

Discrete Structures and Algorithms (Seminar)

by Paul Leopardi


Institution: The University of Melbourne and Australian Government - Bureau of Meteorology
Date: Thu 5th October 2017
Time: 11:00 AM
Location: Room 107, Peter Hall Building

Abstract: Bent Boolean functions are fascinating and useful combinatorial objects, whose applications include coding theory and cryptography. In even dimensions, the bent functions are those Boolean functions that are at the maximum Hamming distance from any affine function. The number of bent functions explodes with dimension, and various concepts of equivalence are used to classify them. In 1999 Bernasconi and Codenotti noted that the Cayley graph of a bent function is strongly regular.

This talk describes the concept of extended Cayley equivalence of bent functions, explores the relationship between extended Cayley equivalence and extended affine equivalence of bent functions, and discusses some connections between bent functions, symmetric designs, linear codes, and strongly regular graphs. SageMath scripts and Cocalc worksheets are used to compute and display some of these relationships and connections, for bent functions up to dimension 8.

For More Information: Contact: Sanming Zhou. email: sanming@unimelb.edu.au