Results 41 to 50 of about 12,156,906 (329)
A New Algorithm for Enumerating Bent Functions Based on Truth Tables and Run Length
IEEE Access, 2018 In this paper, we first provide some properties of truth tables of bent functions. Furthermore, a upper bound of truth table's runs length of a bent function is presented. Based on these results, we propose a new algorithm for enumerating bent functions.
Yongbin Zhao +4 more
doaj +1 more source
A New Family of Boolean Functions with Good Cryptographic Properties
Axioms, 2021 In 2005, Philippe Guillot presented a new construction of Boolean functions using linear codes as an extension of the Maiorana–McFarland’s (MM) construction of bent functions.
Guillermo Sosa-Gómez +3 more
doaj +1 more source
More Constructions of 3-Weight Linear Codes
Journal of Mathematics, 2021 Linear codes with few weights have become an interesting research topic and important applications of cryptography and coding theory. In this paper, we apply some ternary near-bent and 2-plateaued functions or r-ary functions to construct more 3-weight ...
Lingyong Ma, Guanjun Li, Fengyan Liu
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1976 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The eight variable homogeneous degree three bent functions
, 2008 We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups.
Charnes, C., Dempwolff, U., Pieprzyk, J.
core +1 more source
Composition construction of new bent functions from known dually isomorphic bent functions [PDF]
, 2022 Bent functions are optimal combinatorial objects and have been studied over the last four decades. Secondary construction plays a central role in constructing bent functions since it may generate bent functions outside the primary classes of bent ...
Guangpu Gao, Weiguo Zhang, Yongjuan Wang
core
Further study of the trace representation of Bent sequences families
Tongxin xuebao, 2007 Linear onto mapping satisfying certain conditions plays an important role in the generation of Bent sequences families.Further discussions were made A well-rounded characterization of these mapping were presented,and known results were showed to be a ...
KE Pin-hui1, ZHANG Jie2, WEN Qiao-yan2
doaj +2 more sources
An upper bound on binomial coefficients in the de Moivre – Laplace form
Журнал Белорусского государственного университета: Математика, информатика, 2022 We provide an upper bound on binomial coefficients that holds over the entire parameter range an whose form repeats the form of the de Moivre – Laplace approximation of the symmetric binomial distribution.
Sergey V. Agievich
doaj +1 more source
On the Dual of Generalized Bent Functions [PDF]
, 2021 In this paper, we study the dual of generalized bent functions $f: V_{n}\rightarrow \mathbb{Z}_{p^k}$ where $V_{n}$ is an $n$-dimensional vector space over $\mathbb{F}_{p}$ and $p$ is an odd prime, $k$ is a positive integer.
Fang-Wei Fu, Jiaxin Wang
core
ALGORITHM FOR GENERATION OF BENT FUNCTIONS USING WAVELET TRANSFORM
Безопасность информационных технологийThe object of this study is bent functions (maximally nonlinear Boolean functions), as well as Boolean functions with high nonlinearity. The subject of the article is the possibility of using the wavelet transform to create bent functions.
Ilya V. Shibakin, Alla B. Levina
doaj +1 more source