A best possible computable upper bound on bent functions

MaRDI QIDQ3368833zbMATH OpenFDO

Authors Ling Wang, Jianzhou Zhang

Publication date 8 February 2006

zbMATH Keywords

partitionupper boundordered characteristic matrix

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

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

Cited in

(2)

• Upper bounding the number of bent functions using 2-row bent rectangles
• scientific article; zbMATH DE number 7300318 (Why is no real title available?)

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)