On Computing the Immunity of Boolean Power Functions Against Fast Algebraic Attacks
From MaRDI portal
Publication:2988353
DOI10.1007/978-3-319-53177-9_16zbMath1487.94210OpenAlexW2587567944MaRDI QIDQ2988353
Publication date: 19 May 2017
Published in: Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53177-9_16
Cites Work
- Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- On the Resistance of Boolean Functions against Fast Algebraic Attacks
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Upper Bounds on Algebraic Immunity of Boolean Power Functions
- Perfect Algebraic Immune Functions
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
- Advances in Cryptology - CRYPTO 2003
- Fast Software Encryption
This page was built for publication: On Computing the Immunity of Boolean Power Functions Against Fast Algebraic Attacks