Probabilistic estimation of the algebraic degree of cryptographic Boolean functions

We propose a probabilistic test, called the deg(f) < k test, for deciding whether the algebraic degree of a cryptographic Boolean function f (given as a black box) is below a certain value k. When f is indeed of degree below k, then f always passes the deg(f) < k test, otherwise it fails each...

Full description

Saved in:
Bibliographic Details
Main Author: Percy Reyes-Paredes
Format: Default Thesis
Published: 2023
Subjects:
Other information and computing sciences not elsewhere classified
Finite Fields
Probabilistic Estimation
Algebraic Degree
Fourier Transform
Moebius Transform
Algebraic normal form
Boolean Functions
Online Access:https://dx.doi.org/10.26174/thesis.lboro.24534487.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://dx.doi.org/10.26174/thesis.lboro.24534487.v1

Similar Items