Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions
From MaRDI portal
Publication:2130055
DOI10.1007/s12095-021-00529-4zbMath1492.94257OpenAlexW3215760779MaRDI QIDQ2130055
Pantelimon Stănică, Ana Sălăgean
Publication date: 25 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00529-4
Combinatorial probability (60C05) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Self-testing/correcting with applications to numerical problems
- Applying cube attacks to stream ciphers in realistic scenarios
- Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
- Linearity testing in characteristic two
- Comparison of Cube Attacks Over Different Vector Spaces
- Cube Attacks on Tweakable Black Box Polynomials
- The Nonhomomorphicity of Boolean Functions
- Advances in Cryptology – CRYPTO 2004
This page was built for publication: Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions