Welcome to the resource topic for 2015/1203
Title:
The graph of minimal distances of bent functions and its properties
Authors: Nikolay Kolomeec
Abstract:A notion of the graph of minimal distances of bent functions is introduced. It is an undirected graph (V, E) where V is the set of all bent functions in 2k variables and (f, g) \in E if the Hamming distance between f and g is equal to 2^k (it is the minimal possible distance between two different bent functions). The maximum degree of the graph is obtained and it is shown that all its vertices of maximum degree are quadratic. It is proven that a subgraph of the graph induced by all functions affinely equivalent to Maiorana—McFarland bent functions is connected.
ePrint: https://eprint.iacr.org/2015/1203
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .