Piecewise constructions of bent and almost optimal Boolean functions
From MaRDI portal
Publication:2491253
DOI10.1007/s10623-005-4036-2zbMath1142.94336OpenAlexW2061086015MaRDI QIDQ2491253
Joseph L. Yucas, Claude Carlet
Publication date: 29 May 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-4036-2
Related Items (max. 100)
Bent and Semi-bent Functions via Linear Translators ⋮ Vectorial bent functions weakly/strongly outside the completed Maiorana-McFarland class ⋮ Enumeration of Kerdock codes of length 64 ⋮ A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts ⋮ Further analysis of bent functions from \(\mathcal{C}\) and \(\mathcal{D}\) which are provably outside or inside \(\mathcal{M}^{\#} \) ⋮ Uniform first-order threshold implementations ⋮ On the construction of new bent functions from the max-weight and min-weight functions of old bent functions ⋮ New secondary constructions of bent functions ⋮ Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions ⋮ A general framework for secondary constructions of bent and plateaued functions ⋮ Two secondary constructions of bent functions without initial conditions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On ``bent functions
- Results on bent functions
- Partially-bent functions
- On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
- Pencils of quadratic forms over finite fields
- Quadratic forms, generalized Hamming weights of codes and curves with many points
- Decomposing bent functions
- Normal Extensions of Bent Functions
- Bent-function sequences
- Maximal families of bent sequences
- Binary sequences with Gold-like correlation but larger linear span
- On cryptographic properties of the cosets of R(1, m)
- Generalized partial spreads
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Fast Software Encryption
This page was built for publication: Piecewise constructions of bent and almost optimal Boolean functions