Results 11 to 20 of about 26,341 (261)
Advances in Mathematics of Communications, 2019 19 ...
Constanza Riera, Pantelimon Stanica
openaire +4 more sources
Random Networks with Quantum Boolean Functions
Mathematics, 2021 We propose quantum Boolean networks, which can be classified as deterministic reversible asynchronous Boolean networks. This model is based on the previously developed concept of quantum Boolean functions.
Mario Franco +3 more
doaj +1 more source
IEEE Transactions on Information Theory, 2005 We present an extensive study of symmetric Boolean functions, especially of their cryptographic properties. Our main result establishes the link between the periodicity of the simplified value vector of a symmetric Boolean function and its degree.
Canteaut, Anne, Videau, Marion
openaire +3 more sources
Quantum algorithms for testing Boolean functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani ...
Erika Andersson +2 more
doaj +1 more source
Testing Boolean Functions Properties [PDF]
Fundamenta Informaticae, 2021 The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is ɛ-far from having that property. We investigate here several types of properties testing for Boolean functions (identity, correlations and balancedness) using the Deutsch-Jozsa algorithm (for the Deutsch ...
Zhengwei Xie +4 more
openaire +3 more sources
Affine equivalence of monomial rotation symmetric Boolean functions: A Pólya’s theorem approach
Journal of Mathematical Cryptology, 2016 Two Boolean functions are affine equivalent if one can be obtained from the other by applying an affine transformation to the input variables. For a long time, there have been efforts to investigate the affine equivalence of Boolean functions. Due to the
Cusick Thomas W. +2 more
doaj +1 more source
Discovering Non-Linear Boolean Functions by Evolving Walsh Transforms with Genetic Programming
Algorithms, 2023 Stream ciphers usually rely on highly secure Boolean functions to ensure safe communication within unsafe channels. However, discovering secure Boolean functions is a non-trivial optimization problem that has been addressed by many optimization ...
Luigi Rovito +2 more
doaj +1 more source
On the Power of Choice for Boolean Functions
SIAM Journal on Discrete Mathematics, 2022 In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to monotone Boolean functions. Fix a number of choices $r\in \mathbb N$ and a sequence of increasing functions $(f_n)_{n\ge 1}$ such that, for every $n\ge 1$, $f_n:\{0,1\}^n\mapsto \{0,1\}$.
Nicolas Fraiman +2 more
openaire +3 more sources
Analyzing capacitated networks via Boolean-based coherent pseudo-Boolean functions [PDF]
Network Biology, 2021 This paper introduces a novel method for analyzing capacitated networks through the utilization of the concept of a "probability-ready expression" for a Boolean-based coherent pseudo-Boolean function. Our main concern is to assess the performance indexes
Ali Muhammad Ali Rushdi +1 more
doaj
On connected Boolean functions
Discrete Applied Mathematics, 1999 Various classes of Boolean functions are introduced: connected, strongly connected, geodetic, convex, strongly convex and concordant. They are characterized by some properties of the subgraph of the Boolean hypercube induced by the (false) true points of a function.
Ekin, O., Hammer, P. L., Kogan, A.
openaire +3 more sources