Balanced Boolean-function nonlinearity problem
Balanced Boolean-function nonlinearity problem
For each integer , determine
where
In particular, determine the exact value of ; the supplied report claims , excluding .
Sources & referencesView supporting material
Primary source
Additional references
- Theoretical Open Problems in Symmetric Cryptography: Verifiable LLM-Guided Analysis — IACR Cryptology ePrint Archive
Progress summary
A new report claims the eight-variable case has been settled at nonlinearity , but the broader problem remains open.
The problem asks for the maximum nonlinearity of balanced Boolean functions, especially in the finite case of variables. Earlier literature treated as a possible maximum and reported as the best-known value.
Known results
- A construction achieved nonlinearity for variables, without proving optimality.
- A experimental study reported for variables using local search, not exhaustive classification.
- Other and computational papers described the maximum as unknown for dimensions beyond the previously settled range.
August 2026 exact-classification claim
An IACR e-print reports that the -variable maximum is exactly , thereby excluding . The supplied evidence does not include an independently checked computational certificate, so this is a claim rather than a verified resolution.
Current status (as of August 2026): The -variable value is claimed to be exactly , but verification of the certificate and the general balanced Boolean-function problem remain open.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.