An asymptotic lower bound on the number of bent functions
From MaRDI portal
Publication:6130608
DOI10.1007/s10623-023-01239-zarXiv2108.00232OpenAlexW4377091158MaRDI QIDQ6130608
Yu. V. Tarannikov, Vladimir N. Potapov, Anna A. Taranenko
Publication date: 3 April 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.00232
bent functionsaffine subspacesperfect matchingsasymptotic boundsplateaued functionstransversals in Latin hypercubes
Orthogonal arrays, Latin squares, Room squares (05B15) Spreads and packing problems in finite geometry (51E23) Boolean functions (94D10)
Cites Work
- Unnamed Item
- On the numbers of 1-factors and 1-factorizations of hypergraphs
- On the number of bent functions from iterative constructions: lower bounds and hypotheses
- Four decades of research on bent functions
- Transversals, plexes, and multiplexes in iterated quasigroups
- On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
- A construction of bent functions from plateaued functions
- The bounds on the number of partitions of the space \(\mathbb{F}_2^m\) into \(k\)-dimensional affine subspaces
- Asymptotic enumeration of correlation-immune Boolean functions
- On plateaued Boolean functions with the same spectrum support
- Counting all bent functions in dimension eight 99270589265934370305785861242880
- Generalized Maiorana-McFarland class and normality of \(p\)-ary bent functions
- A family of difference sets in non-cyclic groups
- Decomposing bent functions
- Bent Rectangles
- Two New Classes of Bent Functions
- Designing Plateaued Boolean Functions in Spectral Domain and Their Classification
- Boolean Functions for Cryptography and Coding Theory
- Bent Functions
This page was built for publication: An asymptotic lower bound on the number of bent functions