Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity

DOI10.1109/TIT.2017.2725918zbMath1374.94956OpenAlexW2734471689MaRDI QIDQ4589432

Deng Tang, Claude Carlet, Zhengchun Zhou, Xiaohu Tang

Publication date: 10 November 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2017.2725918

Mathematics Subject Classification ID

Related Items (6)

Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction ⋮ A family of weightwise (almost) perfectly balanced Boolean functions with optimal algebraic immunity ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost ⋮ The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields

This page was built for publication: Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity