On the algebraic immunity of multiplexer Boolean functions
From MaRDI portal
Publication:2168796
DOI10.1515/JMC-2021-0027zbMATH Open1498.94116OpenAlexW4285611168MaRDI QIDQ2168796FDOQ2168796
Authors: P. R. Mishra, Shashi Kant Pandey
Publication date: 26 August 2022
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2021-0027
Recommendations
Cites Work
- Vectorial Boolean functions for cryptography
- Perfect nonlinear S-boxes
- On ``bent functions
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- Cryptographic Boolean functions and applications.
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Cryptographic properties of the hidden weighted bit function
- Cryptographically resilient functions
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Title not available (Why is that?)
- Normal Extensions of Bent 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
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- A new construction of highly nonlinear S-boxes
- Optimal correlation attack on the multiplexer generator
Cited In (6)
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)