Ensuring functional correctness is achieved through formal verification. As circuit complexity
increases, limiting the upper bounds for time and space required for verification becomes …

In this paper, we present a library with sequential and parallel functions for computing some
of the most important cryptographic characteristics of Boolean and vectorial Boolean …

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 …

Solving a polynomial system over a finite field is an NP-complete problem of fundamental
importance in both pure and applied mathematics. In particular, the security of the so-called …

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 …

The Reed-Muller transform is widely used in discrete mathematics and cryptography, in
particular for computing the algebraic normal form of Boolean functions. This is a good …