Counting Boolean functions with faster points
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5504476 (Why is no real title available?)
- scientific article; zbMATH DE number 3952651 (Why is no real title available?)
- Counting and characterising functions with ``fast points for differential attacks
- Cube Attacks on Tweakable Black Box Polynomials
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
- Distinguishing properties and applications of higher order derivatives of Boolean functions
- Higher Order Derivatives and Differential Cryptanalysis
- Improving key recovery to 784 and 799 rounds of Trivium using optimized cube attacks
- Some inverse relations
- \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
Cited in
(4)
This page was built for publication: Counting Boolean functions with faster points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200517)