A best possible computable upper bound on bent functions

zbMATH Open1086.94023MaRDI QIDQ3368833FDOQ3368833

Authors: Ling Wang, Jianzhou Zhang 

Publication date: 8 February 2006

Recommendations

• scientific article; zbMATH DE number 6508183
• A novel algorithm enumerating bent functions
• Publication:4944734
• On the number of bent functions from iterative constructions: lower bounds and hypotheses
• Some properties of bent functions

zbMATH Keywords

partitionupper boundordered characteristic matrix

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Cited In (2)

• Upper bounding the number of bent functions using 2-row bent rectangles
• Title not available (Why is that?)

This page was built for publication: A best possible computable upper bound on bent functions

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