Bent functions from spreads
Author:
- Sihem MesnagerSMSihem Mesnager
- 1 January 2015
- book chapter
- Published by American Mathematical Society (AMS)
- Vol. 632, 295-316
Abstract
Bent functions are optimal combinatorics objects. Since the introduction of these functions, substantial efforts have been directed towards their study in the last three decades. In this paper, we are interested firstly in bent functions on F 2 n \mathbb {F}_{2^n} whose restriction to n 2 \frac {n}2 -spreads are constant. The study of such bent functions motivates the clarification of connections between various subclasses of the class of partial bent functions and relations to the class of hyper-bent functions. We investigate their logic relations and state results giving more insight. We also draw a Venn diagram which explains the relations between these classes. Secondly, we present in a synthetic way the most important progresses obtained about the bent functions on F 2 n \mathbf {F}_{2^n} whose restrictions to n 2 \frac {n}2 -spreads are linear. Finally, we present our advances obtained about the bent functions on F 2 n \mathbb {F}_{2^n} whose restrictions to n 2 \frac {n}2 -spreads are affine.Keywords
This publication has 14 references indexed in Scilit:
- Bent functions on partial spreadsDesigns, Codes and Cryptography, 2013
- On Dillonʼs class H of bent functions, Niho bent functions and o-polynomialsJournal of Combinatorial Theory, Series A, 2011
- A new class of bent and hyper-bent Boolean functions in polynomial formsDesigns, Codes and Cryptography, 2010
- Boolean Functions for Cryptography and Error-Correcting Codes2010
- Hyper-bent Boolean Functions with Multiple Trace TermsLecture Notes in Computer Science, 2010
- A New Family of Hyper-Bent Boolean Functions in Polynomial FormLecture Notes in Computer Science, 2009
- Hyperbent functions, Kloosterman sums and Dickson polynomials2008
- Hyper-bent functions and cyclic codesJournal of Combinatorial Theory, Series A, 2006
- Hyper-bent FunctionsLecture Notes in Computer Science, 2001
- On “bent” functionsJournal of Combinatorial Theory, Series A, 1976