Results 11 to 20 of about 12,156,906 (329)
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chengxin Qu +2 more
core +5 more sources
Construction of bent functions from near-bent functions
Journal of Combinatorial Theory, Series A, 2009 A function \(f\) from an \(n\)-dimensional vector space \(V_n\) over \(\mathbb{F}_2\) into \(\mathbb{F}_2\) is called bent (near-bent) if its Walsh transform \(\hat{f}(u) = \sum_{x\in V_n}(-1)^{f(x)+\langle u,x\rangle}\) where \(\langle\;,\;\rangle\) denotes any inner product on \(V_n\) takes values in \(\{\pm 2^{n/2}\}\) (\(\{0,\pm 2^{(n+1)/2 ...
Gregor Leander, Gary McGuire
openaire +3 more sources
Vectorial bent functions in odd characteristic and their components
Cryptography and Communications, 2020 Bent functions in odd characteristic can be either (weakly) regular or non-weakly regular. Furthermore one can distinguish between dual-bent functions, which are bent functions for which the dual is bent as well, and non-dual bent functions.
Meidl, Wilfried +2 more
core +2 more sources
Journal of Telecommunications and Information Technology, 2003 Bent functions, having the highest possible nonlinearity, are among the best candidates for construction of S-boxes. One problem with bent functions is the fact that they are hard to find among randomly generated set of Boolean functions already for 6 ...
Anna Grocholewska-Czuryło
doaj +2 more sources
On the ranks of bent functions
Finite Fields and Their Applications, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guobiao Weng +2 more
openaire +3 more sources
On bent and hyper-bent functions [PDF]
, 2012 Bent functions are Boolean functions which have maximum possible nonlinearity i.e. maximal distance to the set of affine functions. They were introduced by Rothaus in 1976. In the last two decades, they have been studied widely due to their interesting combinatorial properties and their applications in cryptography.
Sarıyüce, Mehmet
openaire +3 more sources
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hou, Xiang-dong, Xiang-dong Hou
openaire +2 more sources
Bent Partitions, Vectorial Dual-Bent Functions and Partial Difference Sets [PDF]
IEEE Transactions on Information Theory, 2023 Bent partitions of $V_{n}^{(p)}$ are quite powerful in constructing bent functions, vectorial bent functions and generalized bent functions, where $V_{n}^{(p)}$ is an $n$ -dimensional vector space over $\mathbb {F}_{p}$ , $n$ is an even positive ...
Jiaxin Wang, Fang-Wei Fu, Yadi Wei
semanticscholar +1 more source
Design and Analysis of Bent Functions Using M-Subspaces [PDF]
IEEE Transactions on Information Theory, 2023 In this article, we provide the first systematic analysis of bent functions $f$ on $\mathbb {F}_{2}^{n}$ in the Maiorana-McFarland class $\mathcal {M}$ regarding the origin and cardinality of their $\mathcal {M}$ -subspaces, i.e., vector ...
E. Pasalic +3 more
semanticscholar +1 more source
A Further Study of Vectorial Dual-Bent Functions [PDF]
IEEE Transactions on Information Theory, 2023 Vectorial dual-bent functions have recently attracted some researchers’ interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions, and linear codes.
Jiaxin Wang +3 more
semanticscholar +1 more source