A characterization of bent functions in terms of strongly regular graphs

DOI10.1109/12.954512MaRDI QIDQ4571343zbMATH OpenOpenAlexFDO

Authors A. Bernasconi, Jeffrey M. Vanderkam, Bruno Codenotti

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4ae03b92fd3536de2b1e6f8e0de662206d6255a5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited in

(12)

• Bent and vectorial bent functions, partial difference sets, and strongly regular graphs
• A link between combinatorial designs and three-weight linear codes
• A survey on \(p\)-ary and generalized bent functions
• Generalized bent Boolean functions and strongly regular Cayley graphs
• Vectorial bent functions and partial difference sets
• Graphs of vectorial plateaued functions as difference sets
• Relationship between homogeneous bent functions and Nagy graphs
• scientific article; zbMATH DE number 7300318 (Why is no real title available?)
• scientific article; zbMATH DE number 7300419 (Why is no real title available?)
• A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
• Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
• Combinatorial designs and cellular automata: a survey

This page was built for publication: A characterization of bent functions in terms of strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571343)