Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function

DOI10.1023/A:1011207501748zbMath1020.94016OpenAlexW1513684005MaRDI QIDQ5939675

Toru Hada, Tadashi Wadayama, Koichiro Wakasugi, Masao Kasahara

Publication date: 29 July 2001

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

Full work available at URL: https://doi.org/10.1023/a:1011207501748

zbMATH Keywords

linear programmingReed-Muller codeBoolean functionbinary linear codesmaximum nonlinearitysecret key cryptosystems

Mathematics Subject Classification ID

Linear programming (90C05) Linear codes (general theory) (94B05) Cryptography (94A60)

Related Items (5)

Nonlinearities of S-boxes ⋮ Linear codes from simplicial complexes ⋮ A note on the minimal binary linear code ⋮ Optimal minimal linear codes from posets ⋮ A new construction of highly nonlinear S-boxes

This page was built for publication: Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function