Hybrid classes of balanced Boolean functions with good cryptographic properties
From MaRDI portal
Publication:726405
DOI10.1016/j.ins.2014.02.157zbMath1341.94014OpenAlexW2091043030MaRDI QIDQ726405
Ferruh Özbudak, Mansoor Ahmed Khan
Publication date: 8 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.157
Boolean functionalgebraic immunityalgebraic degreenon-linearityoptimal algebraic immunitysymmetric cipher
Related Items (3)
Construction and count of 1-resilient rotation symmetric Boolean functions ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields ⋮ Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Construction of 1-resilient Boolean functions with optimal algebraic immunity and good non\-linearity
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A New Attack on the Filter Generator
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- Cryptographically resilient functions
- Construction of Boolean functions with maximum algebraic immunity and count of their annihilators at lowest degree
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- On the Algebraic Immunity of Symmetric Boolean Functions
- Fast Software Encryption
- Progress in Cryptology – Mycrypt 2005
- Fast Software Encryption
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: Hybrid classes of balanced Boolean functions with good cryptographic properties