Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
From MaRDI portal
Recommendations
- Best Affine and Quadratic Approximations of Particular Classes of Boolean Functions
- Compact quadratizations for pseudo-Boolean functions
- On the multiplicative complexity of quasi-quadratic Boolean functions
- Computational aspects of Boolean cubature
- scientific article; zbMATH DE number 3914086
- On the complexity of solving quadratic Boolean systems
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- The conjunctive complexity of quadratic Boolean functions
- scientific article; zbMATH DE number 4074972
- Bounds for the number of Boolean functions admitting quadratic approximations of given accuracy
Cites work
- A family of difference sets in non-cyclic groups
- A new characterization of semi-bent and bent functions on finite fields
- Cryptanalysis of Achterbahn
- scientific article; zbMATH DE number 3539225 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3598362 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- scientific article; zbMATH DE number 1455087 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- Low order approximation of cipher functions
- New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
- Non-linear approximations in linear cryptanalysis
- On ``bent functions
- On Bent and Semi-Bent Quadratic Boolean Functions
- On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- On the weight structure of Reed-Muller codes
- Partially-bent functions
- Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
- The stability theory of stream ciphers
This page was built for publication: Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447509)