A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code

DOI10.1007/S10623-013-9801-ZzbMATH Open1321.94091OpenAlexW2017858430MaRDI QIDQ2249793FDOQ2249793

Authors: Sihong Su, Xiaohu Tang, Xiangyong Zeng 

Publication date: 3 July 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-013-9801-z

Recommendations

• Construction of balanced even-variable Boolean functions with optimal algebraic immunity
• Boolean functions with maximum algebraic immunity based on properties of punctured Reed-Muller codes
• Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
• On the Construction of Boolean Functions With Optimal Algebraic Immunity
• A New Construction of Boolean Functions with Maximum Algebraic Immunity

zbMATH Keywords

nonlinearityalgebraic immunityBoolean functionsReed-Muller codegenerator matrix

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cites Work

• Fast correlation attacks on certain stream ciphers
• The stability theory of stream ciphers
• Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Fast Software Encryption
• Coding and Cryptography
• Basic theory in construction of Boolean functions with maximum possible annihilator immunity
• Advances in Cryptology - EUROCRYPT 2004
• Maximal values of generalized algebraic immunity
• A Method of Construction of Balanced Functions with Optimum Algebraic Immunity
• Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
• Advances in Cryptology – CRYPTO 2004
• Further properties of several classes of Boolean functions with optimum algebraic immunity
• An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
• Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity
• Fast Software Encryption
• Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
• On Symmetric Boolean Functions With High Algebraic Immunity on Even Number of Variables
• More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
• A New Construction of Boolean Functions with Maximum Algebraic Immunity
• Reducing the Number of Homogeneous Linear Equations in Finding Annihilators

Cited In (4)

• Construction of balanced even-variable Boolean functions with optimal algebraic immunity
• Constructing \(2m\)-variable Boolean functions with optimal algebraic immunity based on polar decomposition of \(\mathbb{F}^*_{2^{2m}}\)
• Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
• Boolean functions with maximum algebraic immunity based on properties of punctured Reed-Muller codes

This page was built for publication: A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249793)