A Conjecture About Gauss Sums and Bentness of Binomial Boolean Functions
From MaRDI portal
Publication:5267799
DOI10.1007/978-3-319-55227-9_11zbMATH Open1409.11130arXiv1608.05008OpenAlexW2526763559MaRDI QIDQ5267799FDOQ5267799
Publication date: 13 June 2017
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Abstract: In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an odd number, an explicit formula involving a Kloosterman sum is conjectured, proved with further restrictions, and supported by extensive experimental data in the general case. In particular, the validity of this formula is shown to be equivalent to a simple and efficient characterization for bentness previously conjectured by Mesnager.
Full work available at URL: https://arxiv.org/abs/1608.05008
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Exponential sums (11T23)
Cites Work
- A new class of bent and hyper-bent Boolean functions in polynomial forms
- Title not available (Why is that?)
- Monomial bent functions
- Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
- A New Family of Hyper-Bent Boolean Functions in Polynomial Form
- Title not available (Why is that?)
- Bent and Hyper-Bent Functions in Polynomial Form and Their Link With Some Exponential Sums and Dickson Polynomials
- New cyclic difference sets with Singer parameters
- Explicit evaluation of certain exponential sums.
- Binary Kloosterman sums using Stickelberger's theorem and the Gross–Koblitz formula
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
- Divisibility properties of classical binary Kloosterman sums
- An efficient deterministic test for Kloosterman sum zeros
- Binary Kloosterman Sums with Value 4
- On the Connection between Kloosterman Sums and Elliptic Curves
Cited In (4)
Uses Software
This page was built for publication: A Conjecture About Gauss Sums and Bentness of Binomial Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267799)