Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
From MaRDI portal
Publication:2392676
Recommendations
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- On the resistance of Boolean functions against fast algebraic attacks
- A note on the optimal immunity of Boolean functions against fast algebraic attacks
- Construction of resilient and nonlinear Boolean functions with almost perfect immunity to algebraic and fast algebraic attacks
- On the resistance of rotation symmetric Boolean functions against fast algebraic attacks
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
- Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
- A class of 1-resilient Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks
Cited in
(4)- A construction of Boolean functions with good cryptographic properties
- On computing the immunity of Boolean power functions against fast algebraic attacks
- Correction to the paper: Patterson-Wiedemann construction revisited
- A note on the optimal immunity of Boolean functions against fast algebraic attacks
This page was built for publication: Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392676)