Counting Boolean functions with faster points

Duan and Lai introduced the notion of “fast point” for a Boolean function f as being a direction a so that the algebraic degree of the derivative of f in direction a is strictly lower than the expected deg( f ) − 1. Their study was motivated by the fact that the existence of fast points makes many c...

Full description

Saved in:
Bibliographic Details
Main Authors: Ana Salagean, Ferruh Özbudak
Format: Default Article
Published: 2020
Subjects:
Theory of computation not elsewhere classified
Computation Theory & Mathematics
Pure Mathematics
Electrical and Electronic Engineering
Differential attacks
Linear structures
Boolean functions
Computation Theory and Mathematics
Online Access:https://hdl.handle.net/2134/12011382.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/12011382.v1

Similar Items