Results 21 to 30 of about 51,980 (308)
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
Widening ROBDDs with Prime Implicants: 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006. Proceedings [PDF]
Despite the ubiquity of ROBDDs in program analysis, and extensive literature on ROBDD minimisation, there is a dearth of work on approximating ROBDDs.
Kettle, Neil +5 more
core +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
On the Power of Choice for Boolean Functions
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
Took the derivative and e-derivative of Boolean function as a tool,analyzed the inner structure of balanced H-Boolean functions,clearly obtained the conclusion that the second-order correlation-immune balanced H-Boolean function is not existent,solved ...
HE Liang, WANG Zhuo, LI Wei-wei
doaj +2 more sources
Partial Boolean Functions With Exact Quantum Query Complexity One
We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and can be
Guoliang Xu, Daowen Qiu
doaj +1 more source
On connected Boolean functions
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
Quantum algorithms for testing and learning Boolean functions
We discuss quantum algorithms based on the Bernstein-Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2(n) possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein-
Floess, Dominik +2 more
core +1 more source
Relationship between correlation immune and weight of H Boolean functions
The Boolean function derivative and e-derivative which together with the derivative so that the weight of Boolean functions can be directly clear characterized and defined as the tools for research and deep into the internal structure of Boolean function
Jing-lian HUANG, Zhuo WANG
doaj +2 more sources

