On the cardinality of the Walsh support of a Boolean function
From MaRDI portal
Cites work
- Algebraic attacks against random local functions and their countermeasures
- Boolean functions for cryptography and coding theory
- Boolean functions with multiplicative complexity 3 and 4
- Characterization of Basic 5-Value Spectrum Functions Through Walsh-Hadamard Transform
- Characterizations of plateaued and bent functions in characteristic p
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Designing Plateaued Boolean Functions in Spectral Domain and Their Classification
- scientific article; zbMATH DE number 1583929 (Why is no real title available?)
- scientific article; zbMATH DE number 5504492 (Why is no real title available?)
- scientific article; zbMATH DE number 1424197 (Why is no real title available?)
- Indistinguishability obfuscation from well-founded assumptions
- On plateaued functions and their constructions.
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- On the concrete security of Goldreich's pseudorandom generator
- On the supports of the Walsh transforms of Boolean functions
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
This page was built for publication: On the cardinality of the Walsh support of a Boolean function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391745)