On the affinity level of Boolean functions
From MaRDI portal
Recommendations
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- On values of affinity level for almost all Boolean functions
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
- Local affinity of Boolean mappings
Cites work
Cited in
(14)- The graph of minimal distances of bent functions and its properties
- Analyzing Boolean functions via solving parametric polynomial systems
- Multiaffinity testing of Boolean functions using their Zhegalkin polynomials
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
- Local affinity of Boolean mappings
- On values of affinity level for almost all Boolean functions
- Statistical approximation theory for discrete functions with application in cryptanalysis of iterative block ciphers
- Lower and upper bounds for the affinity order of transformations of Boolean vector spaces
- scientific article; zbMATH DE number 7310259 (Why is no real title available?)
- On the relationship between local affinities of a Boolean function and some types of its degeneracy
- On permutations that break subspaces of specified dimensions
- On the strong affinity level of Boolean functions
This page was built for publication: On the affinity level of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491246)
