Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice
From MaRDI portal
Publication:2945067
DOI10.1007/978-3-319-12325-7_5zbMath1337.94118OpenAlexW585322992MaRDI QIDQ2945067
Publication date: 9 September 2015
Published in: Sequences and Their Applications - SETA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12325-7_5
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New Kloosterman sum identities and equalities over finite fields
- On ``bent functions
- Hyper-bent functions and cyclic codes
- A new class of bent and hyper-bent Boolean functions in polynomial forms
- Construction of bent functions via Niho power functions
- An efficient characterization of a family of hyper-bent functions with multiple trace terms
- Dickson Polynomials, Hyperelliptic Curves and Hyper-bent Functions
- Hyperbent Functions via Dillon-Like Exponents
- Several New Classes of Bent Functions From Dillon Exponents
- Monomial bent functions
- Hyper-bent Boolean Functions with Multiple Trace Terms
- Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
- Cubic Monomial Bent Functions: A Subclass of $\mathcal{M}$
- A New Family of Hyper-Bent Boolean Functions in Polynomial Form
- Explicit evaluation of certain exponential sums.
- Transform domain analysis of DES
- Bent and Hyper-Bent Functions in Polynomial Form and Their Link With Some Exponential Sums and Dickson Polynomials
- An Efficient Characterization of a Family of Hyperbent Functions
- A Survey of Some Recent Results on Bent Functions
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
