On the algebraic immunity of multiplexer Boolean functions
From MaRDI portal
Publication:2168796
Recommendations
Cites work
- scientific article; zbMATH DE number 503330 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- A new construction of highly nonlinear S-boxes
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Cryptographic Boolean functions and applications.
- Cryptographic properties of the hidden weighted bit function
- Cryptographically resilient functions
- Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions − 9 Variable Boolean Functions with Nonlinearity 242
- Generic cryptographic weakness of \(k\)-normal Boolean functions in certain stream ciphers and cryptanalysis of Grain-128
- Normal Extensions of Bent Functions
- On ``bent functions
- Optimal correlation attack on the multiplexer generator
- Perfect nonlinear S-boxes
- Vectorial Boolean functions for cryptography
Cited in
(6)- scientific article; zbMATH DE number 6263966 (Why is no real title available?)
- Progress in Cryptology - INDOCRYPT 2004
- scientific article; zbMATH DE number 6001198 (Why is no real title available?)
- scientific article; zbMATH DE number 5524540 (Why is no real title available?)
- On the maximal component algebraic immunity of vectorial Boolean functions
- On the fast algebraic immunity of majority functions
This page was built for publication: On the algebraic immunity of multiplexer Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168796)