Classifying bent functions by their Cayley graphs

2017/05/12 by Paul Leopardi, Leopardi, Paul
Computer Science · Engineering · Medicine · #05E30 #11T71 #Cancer Mechanisms and Therapy #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1705.04507

openalex publication_date 2017/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 1999 Bernasconi and Codenotti noted that the Cayley graph of a bent function is strongly regular. This paper describes the concept of extended Cayley equivalence of bent functions, discusses some connections between bent functions, designs, and codes, and explores the relationship between extended Cayley equivalence and extended affine equivalence. SageMath scripts and CoCalc worksheets are used to compute and display some of these relationships, for bent functions up to dimension 8.

Citations

• Strongly regular graphs constructed from p-ary bent functions
• Constructing Symmetric Ciphers Using the CAST Design Procedure

Related

• Bent functions and strongly regular graphs
• Explorations of edge-weighted Cayley graphs and p-ary bent functions
• Generalized bent Boolean functions and strongly regular Cayley graphs
• On p-ary Bent Functions and Strongly Regular Graphs
• On the representation of bent functions by bent rectangles