On the $q$-Bentness of Boolean Functions

November 08, 2017 Β· Declared Dead Β· πŸ› Des. Codes Cryptogr.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zhixiong Chen, Ting Gu, Andrew Klapper arXiv ID 1711.02917 Category cs.CR: Cryptography & Security Citations 3 Venue Des. Codes Cryptogr. Last Checked 4 months ago
Abstract
For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of basis. Klapper conjectured that no Boolean function exists with its $q$-transform coefficients equal to $\pm 2^{n/2}$ (such function is called $q$-bent). In our early work, we only gave partial results to confirm this conjecture for small $n$. Here we prove thoroughly that the conjecture is true by investigating the nonexistence of the partial difference sets in Abelian groups with special parameters. We also introduce a new family of functions called almost $q$-bent functions, which are close to $q$-bentness.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Cryptography & Security

Died the same way β€” πŸ‘» Ghosted