A Conjecture About Gauss Sums and Bentness of Binomial Boolean Functions
From MaRDI portal
Publication:5267799
DOI10.1007/978-3-319-55227-9_11zbMath1409.11130arXiv1608.05008OpenAlexW2526763559MaRDI QIDQ5267799
Publication date: 13 June 2017
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05008
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Exponential sums (11T23)
Related Items (2)
Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields ⋮ The solution to an open problem on the bentness of Mesnager's functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New cyclic difference sets with Singer parameters
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
- Divisibility properties of classical binary Kloosterman sums
- A new class of bent and hyper-bent Boolean functions in polynomial forms
- An efficient deterministic test for Kloosterman sum zeros
- Binary Kloosterman sums using Stickelberger's theorem and the Gross–Koblitz formula
- Binary Kloosterman Sums with Value 4
- Monomial bent functions
- On the Connection between Kloosterman Sums and Elliptic Curves
- Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
- A New Family of Hyper-Bent Boolean Functions in Polynomial Form
- Explicit evaluation of certain exponential sums.
- Bent and Hyper-Bent Functions in Polynomial Form and Their Link With Some Exponential Sums and Dickson Polynomials
This page was built for publication: A Conjecture About Gauss Sums and Bentness of Binomial Boolean Functions