An algorithm for the spectral immunity of binary sequence with period 2 n
From MaRDI portal
Publication:2825267
DOI10.1007/s11859-016-1147-8zbMath1363.94066OpenAlexW2440206734MaRDI QIDQ2825267
Publication date: 6 October 2016
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-016-1147-8
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- Unnamed Item
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- On \((2^{m}+1)\)-variable symmetric Boolean functions with submaximum algebraic immunity \(2^{m - 1}\)
- On the \(2^{m}\)-variable symmetric Boolean functions with maximum algebraic immunity
- A class of rotation symmetric Boolean functions with optimum algebraic immunity
- Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- Fast Discrete Fourier Spectra Attacks on Stream Ciphers
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Progress in Cryptology – Mycrypt 2005
- Fast Software Encryption
