A medical image encryption algorithm using high-speed scrambling and pixel adaptive
diffusion was recently proposed by Hua et al. The algorithm mainly consists of random data …

The representation of Boolean functions by their algebraic normal forms (ANFs) is very
important for cryptography, coding theory and other scientific areas. The ANFs are used in …

Here we consider an approach for fast computing the algebraic degree of Boolean functions.
It combines fast computing the ANF (known as ANF transform) and thereafter the algebraic …

The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important
cryptographic parameter that should be computed by fast algorithms. They work in two main …

As of late, both the fields of quantum computing and machine learning have experienced
simultaneous developments. It is thus naturally that the interplay between these two fields is …

The problem “Given a Boolean function f of n variables by its truth table vector. Find (if exists)
a vector α∈{0, 1} n of maximal (or minimal) weight, such that f (α)= 1.” is considered here. It …

The paper is focused on decomposition of Boolean functions in the form f_ 1 ∘ ... ∘ f_ m,
where ∘ is a commutative associative operation and f_ 1, ..., f_ m are Boolean functions with …

In this paper we establish some properties about Boolean functions that allow us to relate
their degree and their support. These properties allow us to compute the degree of a …

В работе исследуется проблема представления булевых функций в виде f1∘…∘ fm,
где∘—коммутативная ассоциативная операция и f1,…, fm—булевы функции меньшей …