Fast Computing the Algebraic Degree of Boolean Functions

05/21/2019
by   Valentin Bakoev, et al.
0

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 degree by using the weight-lexicographic order (WLO) of the vectors of the n-dimensional Boolean cube. Byte-wise and bitwise versions of a search based on the WLO and their implementations are discussed. They are compared with the usual exhaustive search applied in computing the algebraic degree. For Boolean functions of n variables, the bitwise implementation of the search by WLO has total time complexity O(n.2^n). When such a function is given by its truth table vector and its algebraic degree is computed by the bitwise versions of the algorithms discussed, the total time complexity is Θ((9n-2).2^n-7)=Θ(n.2^n). All algorithms discussed have time complexities of the same type, but with big differences in the constants hidden in the Θ-notation. The experimental results after numerous tests confirm the theoretical results - the running times of the bitwise implementation are dozens of times better than the running times of the byte-wise algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2020

A Method for Fast Computing the Algebraic Degree of Boolean Functions

The algebraic degree of Boolean functions (or vectorial Boolean function...
research
11/11/2018

About the ordinances of the vectors of the n-dimensional Boolean cube in accordance with their weights

The problem "Given a Boolean function f of n variables by its truth tabl...
research
04/15/2020

On the computation of the Möbius transform

The Möbius transform is a crucial transformation into the Boolean world;...
research
06/21/2023

Probabilistic estimation of the algebraic degree of Boolean functions

The algebraic degree is an important parameter of Boolean functions used...
research
06/06/2023

Computing all monomials of degree n-1 using 2n-3 AND gates

We consider the vector-valued Boolean function f:{0,1}^n→{0,1}^n that ou...
research
01/17/2022

Improved Degree Evaluation and Superpoly Recovery methods with Application to Trivium

Cube attack is one powerful method in the cryptanalysis of NFSR-based ci...
research
06/15/2020

Fast algebraic immunity of Boolean functions and LCD codes

Nowadays, the resistance against algebraic attacks and fast algebraic at...

Please sign up or login with your details

Forgot password? Click here to reset