[Resource Topic] 2022/1412: Boolean Polynomial Evaluation for the Masses

Welcome to the resource topic for 2022/1412

Title:
Boolean Polynomial Evaluation for the Masses

Authors: Charles Bouillaguet

Abstract:

This article gives improved algorithms to evaluate a multivariate Boolean
polynomial over all the possible values of its input variables. Such a
procedure is often used in cryptographic attacks against symmetric schemes.
More precisely, we provide improved and simplified versions of the
Fast Exhaustive Search algorithm presented at CHES’10 and of the
space-efficient Moebius transform given by Dinur at EUROCRYPT’21.
The new algorithms require \mathcal{O}(d 2^n) operations with a degree-d
polynomial and operate in-place.
We provide the full C code of a complete implementation under
the form of a ``user-friendly’’ library called BeanPolE, which we hope
could be helpful to other cryptographers. This paper actually contains
all the code, which is quite short.

ePrint: https://eprint.iacr.org/2022/1412

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .