On generalized hyper-bent functions
From MaRDI portal
Publication:2202891
DOI10.1007/s12095-019-00390-6zbMath1478.11151OpenAlexW2968431179WikidataQ127390546 ScholiaQ127390546MaRDI QIDQ2202891
Publication date: 30 September 2020
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-019-00390-6
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Boolean functions (94D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A class of hyper-bent functions and Kloosterman sums
- Generalized bent functions -- some general construction methods and related necessary and sufficient conditions
- Four decades of research on bent functions
- Strongly regular graphs associated with ternary bent functions
- Generalized bent functions and their properties
- On ``bent functions
- Homogeneous bent functions, invariants, and designs
- Hyper-bent functions and cyclic codes
- On zeros of Kloosterman sums
- A new class of bent and hyper-bent Boolean functions in polynomial forms
- An efficient characterization of a family of hyper-bent functions with multiple trace terms
- Dickson Polynomials, Hyperelliptic Curves and Hyper-bent Functions
- Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice
- On Weak and Strong -Bent Boolean Functions
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Linear Codes From Some 2-Designs
- Vectorial Hyperbent Trace Functions From the \(\mathcal {PS}_{\rm ap}\) Class—Their Exact Number and Specification
- Hyperbent Functions via Dillon-Like Exponents
- A Note on Generalized Bent Criteria for Boolean Functions
- A Note on Fast Algebraic Attacks and Higher Order Nonlinearities
- Binary Kloosterman Sums with Value 4
- Hyper-bent Boolean Functions with Multiple Trace Terms
- Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
- A New Family of Hyper-Bent Boolean Functions in Polynomial Form
- Bent-function sequences
- Transform domain analysis of DES
- Decomposing Generalized Bent and Hyperbent Functions
- Attacks Against Filter Generators Exploiting Monomial Mappings
- Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image
- Further Results on Generalized Bent Functions and Their Complete Characterization
- Quaternary Constant-Amplitude Codes for Multicode CDMA
- Generalized Bent Functions and Their Gray Images
- 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
- Bent Functions
- Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions
This page was built for publication: On generalized hyper-bent functions