Bounds for the average degree-<i>k</i> monomial density of Boolean functions

In cryptographic applications, Boolean functions are typically represented in algebraic normal form, i.e. as multivariate polynomial functions over the finite field F2. For such a function f, we consider, for each degree k, the density of monomials of degree k in f, i.e. the number of monomials of d...

Full description

Bibliographic Details

Main Authors:	Ana Salagean, Percy Reyes-Paredes
Format:	Default Article
Published:	2025
Subjects:	Applied mathematics Numerical and computational mathematics Pure mathematics Algebraic degree Möbius transform Probabilistic testing
Online Access:	https://hdl.handle.net/2134/30786137.v1
Tags:	Add Tag No Tags, Be the first to tag this record!