On \((2^{m}+1)\)-variable symmetric Boolean functions with submaximum algebraic immunity \(2^{m - 1}\)
From MaRDI portal
Publication:1042839
DOI10.1007/s11425-008-0131-yzbMath1193.94085OpenAlexW2006283638MaRDI QIDQ1042839
Feng Liu, Qunying Liao, Ke Qin Feng
Publication date: 7 December 2009
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-008-0131-y
Exact enumeration problems, generating functions (05A15) Cryptography (94A60) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Related Items (3)
On designated-weight Boolean functions with highest algebraic immunity ⋮ On the construction of multi-output Boolean functions with optimal algebraic immunity ⋮ An algorithm for the spectral immunity of binary sequence with period 2 n
Cites Work
- Unnamed Item
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Symmetric Boolean Functions
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- On the Algebraic Immunity of Symmetric Boolean Functions
- Progress in Cryptology - INDOCRYPT 2004
- Progress in Cryptology - INDOCRYPT 2004
- Fast Software Encryption
This page was built for publication: On \((2^{m}+1)\)-variable symmetric Boolean functions with submaximum algebraic immunity \(2^{m - 1}\)
