Sign Up to like & get
recommendations!
0
Published in 2019 at "Algebra universalis"
DOI: 10.1007/s00012-019-0578-4
Abstract: We consider the problem of approximating distributions of Bernoulli random variables by applying Boolean functions to independent random variables with distributions from a given set. For a set B of Boolean functions, the set of approximable…
read more here.
Keywords:
induced approximation;
approximation algebras;
clone induced;
bernoulli distributions ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Quantum Information Processing"
DOI: 10.1007/s11128-019-2303-9
Abstract: In classical cryptography, many cryptographic primitives could be treated as multi-output Boolean functions. The analysis of such functions is of great interest for cryptologists owing to their wide ranges of applications. Since each multi-output Boolean…
read more here.
Keywords:
boolean functions;
multi output;
quantum;
output boolean ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
0
Published in 2018 at "Cryptography and Communications"
DOI: 10.1007/s12095-018-0297-2
Abstract: The multiplicative complexity of a Boolean function is the minimum number of two-input AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT). Finding the multiplicative complexity of…
read more here.
Keywords:
functions multiplicative;
complexity;
boolean functions;
multiplicative complexity ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2018 at "Cryptography and Communications"
DOI: 10.1007/s12095-018-0341-2
Abstract: Many problems in the domains of cryptography, coding theory, sequence theory and circuit theory can be formulated in terms of Boolean functions. The connections between these domains and Boolean functions, and between these domains through…
read more here.
Keywords:
theory;
functions applications;
boolean functions;
coding theory ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2019 at "Cryptography and Communications"
DOI: 10.1007/s12095-019-00409-y
Abstract: This is the third special issue of Cryptography and Communications dedicated to Boolean functions and their applications (the previous two appeared in 2016 and 2019 and were associated with the events of BFA 2014 and…
read more here.
Keywords:
functions applications;
apn;
boolean functions;
special issue ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "Forum of Mathematics, Sigma"
DOI: 10.1017/fms.2017.24
Abstract: We prove that Boolean functions on $S_{n}$ , whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$ , are close to being…
read more here.
Keywords:
application isoperimetry;
degree boolean;
functions application;
size ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "IEEE Access"
DOI: 10.1109/access.2017.2764919
Abstract: Resilient vectorial Boolean functions are desirable for both stream cipher and block cipher, which are widely used in information security protection. The tradeoffs between resiliency and nonlinearity have received considerable attention. In this paper, a…
read more here.
Keywords:
resilient vectorial;
constructions highly;
boolean functions;
nonlinear resilient ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2926765
Abstract: Boolean functions should possess high fast algebraic immunity when used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the fast algebraic immunity of Boolean functions was usually…
read more here.
Keywords:
fast algebraic;
class resilient;
resilient boolean;
algebraic immunity ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2020 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2020.2981023
Abstract: In this letter, a new construction of Z-complementary pairs (ZCPs) with more flexible lengths based on generalized Boolean functions is proposed. Except for the powers of two, the proposed ZCPs exist for all lengths with…
read more here.
Keywords:
pairs flexible;
generalized boolean;
flexible lengths;
boolean functions ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2021 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2020.3045727
Abstract: In this letter, a novel construction of binary cross Z-complementary pairs (CZCPs) based on Boolean functions is proposed. CZCPs have been proposed to be used as training sequences in the spatial modulation system. Due to…
read more here.
Keywords:
binary cross;
cross complementary;
flexible lengths;
boolean functions ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2018 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2017.2750674
Abstract: This paper presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $\sum _{l=0}^{n} \binom {n}{l} x_{l}=0$ ,…
read more here.
Keywords:
tex math;
symmetric boolean;
boolean functions;
inline formula ... See more keywords