Results 11 to 20 of about 24,202 (263)
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
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
Advances in Mathematics of Communications, 2019 19 ...
Riera, Constanza, Stănică, Pantelimon
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
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
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
Self-Predicting Boolean Functions [PDF]
SIAM Journal on Discrete Mathematics, 2018 A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is obtained from $X^{n}$ by independently flipping each coordinate with probability $ $.
Weinberger, Nir, Shayevitz, Ofer
openaire +3 more sources
Certificate complexity and symmetry of nested canalizing functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Boolean nested canalizing functions (NCFs) have important applications in molecular regulatory networks, engineering and computer science. In this paper, we study their certificate complexity.
Yuan Li, Frank Ingram, Huaming Zhang
doaj +1 more source
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