Enhanced Boolean functions suitable for the filter model of pseudo-random generator
From MaRDI portal
Publication:494592
DOI10.1007/s10623-014-9978-9zbMath1359.94573OpenAlexW2004360898MaRDI QIDQ494592
Publication date: 1 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9978-9
Cryptography (94A60) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)
Related Items (3)
Fast algebraic immunity of Boolean functions ⋮ Open Questions on Nonlinearity and on APN Functions ⋮ A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfectly balanced Boolean functions and Golić conjecture
- Maximal values of generalized algebraic immunity
- Fast correlation attacks on certain stream ciphers
- The stability theory of stream ciphers
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- New methods of investigation of perfectly balanced Boolean functions
- On Immunity Profile of Boolean Functions
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A New Attack on the Filter Generator
- 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
- Communication Theory of Secrecy Systems*
- On the security of nonlinear filter generators
- On nonlinear filter generators
- Perfect Algebraic Immune Functions
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
- Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Shift-register synthesis and BCH decoding
- Fast Software Encryption
- Coding and Cryptography
This page was built for publication: Enhanced Boolean functions suitable for the filter model of pseudo-random generator
