Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Minimum Distance between Bent and Resilient Boolean Functions
verfasst von : Longjiang Qu, Chao Li
Erschienen in: Coding and Cryptology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The minimum distance between bent and resilient functions is studied. This problem is converted into two problems. One is to construct a special matrix, which leads to a combinatorial problem; the other is the existence of bent functions with specified types. Then the relation of these two problems is studied. For the 1-resilient functions, we get a solution to the first combinatorial problem. By using this solution and the relation of the two problems, we present a formula on the lower bound of the minimum distance of bent and 1-resilient functions. For the latter problem, we point out the limitation of the usage of the Maiorana-McFarland type bent functions, and the necessity to study the existence of bent functions with special property which we call partial symmetric. At last, we give some results on the nonexistence of some partial symmetric bent functions.