Boolean functions optimizing most of the cryptographic criteria

DOI10.1016/j.dam.2011.08.006zbMath1271.94026OpenAlexW2061056250MaRDI QIDQ412332

Yingpu Deng, Ziran Tu

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.006

zbMATH Keywords

balancednessnonlinearityBoolean functionalgebraic immunityalgebraic degreeresiliencycorrelation immunity

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items (12)

Approaching Cusick's conjecture on the sum-of-digits function ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ The binary digits of n+t ⋮ A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost ⋮ A combinatorial condition and Boolean functions with optimal algebraic immunity ⋮ Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields ⋮ The Tu-Deng conjecture holds almost surely ⋮ Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria ⋮ Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation ⋮ New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions ⋮ A lower bound for Cusick’s conjecture on the digits of n + t

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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 ``bent functions
• On a Combinatorial Conjecture
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
• On a Conjecture about Binary Strings Distribution
• 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
• A spectral characterization of correlation-immune combining functions
• Further constructions of resilient Boolean functions with very high nonlinearity
• Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
• Fast Software Encryption

This page was built for publication: Boolean functions optimizing most of the cryptographic criteria