On the number of resilient Boolean functions

zbMATH Open1153.94411MaRDI QIDQ3545367FDOQ3545367

Authors: Sihem Mesnager 

Publication date: 10 December 2008

Recommendations

• An Upper Bound on the Number of m-Resilient Boolean Functions
• scientific article; zbMATH DE number 1955795
• Construction and count of 1-resilient rotation symmetric Boolean functions
• Construction of cryptographically significant Boolean functions
• Cryptographically resilient functions

zbMATH Keywords

Boolean functionsresiliencyresidue calculusmultivariate generating function

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (5)

• Title not available (Why is that?)
• An Upper Bound on the Number of m-Resilient Boolean Functions
• A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions
• Construction and count of 1-resilient rotation symmetric Boolean functions
• On influences of Boolean variables and their computation

This page was built for publication: On the number of resilient Boolean functions

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