Results 11 to 20 of about 40,553 (242)
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
An Algorithm for Minimization of Boolean Functions in the Class of Toffoli Reversible Logic Circuits [PDF]
In this paper, the problem of Boolean function's representation by the reversible circuits constructed of the Toffoli gates is considered. Interest in this problem is connected with actual studies of the possibility for realization of "cold" computations.
A.S. Frantseva
doaj +1 more source
19 ...
Riera, Constanza, Stănică, Pantelimon
openaire +4 more sources
There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers.
Aleksey I. Pakhomchik +3 more
doaj +1 more source
Hybrid tabu search algorithm for excellent Boolean function
Boolean function in symmetric cryptographic algorithm must satisfy excellent cryptographic criteria to ensure the security of the algorithm.By combining the advantages of tabu search algorithm and hill climbing algorithm, a new heuristic generation ...
Weiqiong WANG +3 more
doaj +2 more sources
On Resilient Boolean and Vectorial Boolean Functions with High Nonlinearity
Boolean functions and vectorial Boolean functions are the most important nonlinear components of stream ciphers. They should satisfy several criteria such as high nonlinearity, proper resiliency and so on to guarantee the security of the whole system ...
Luyang Li +3 more
doaj +1 more source
On the algebraic immunity of multiplexer Boolean functions
A multiplexer generator is a device that accepts two or more inputs and based on some logic sends one of them as output. In a special case when inputs to a multiplexer generator are 2k{2}^{k} bits and one of them is selected according to the value of a ...
Mishra Prasanna R., Pandey Shashi Kant
doaj +1 more source
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
O b j e c t i v e s . The problem of synthesis of combinational circuits in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR.
Yu. V. Pottosin
doaj +1 more source
Further research results on confusion coefficient of Boolean functions
The notion of confusion coefficient (CC) is a property that attempts to characterize the confusion property of cryptographic algorithms against differential power analysis.
Liu Zhenyu, Zhuo Zepeng
doaj +1 more source
Self-Predicting Boolean Functions [PDF]
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

