An infinite family of 0-APN monomials with two parameters

November 24, 2022 Β· Declared Dead Β· πŸ› Cryptography and Communications

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nikolay Kaleyski, Kjetil Nesheim, Patenlimon Stănică arXiv ID 2211.13485 Category math.NT Cross-listed cs.CR Citations 0 Venue Cryptography and Communications Last Checked 4 months ago
Abstract
We consider an infinite family of exponents $e(l,k)$ with two parameters, $l$ and $k$, and derive sufficient conditions for $e(l,k)$ to be 0-APN over $\mathbb{F}_{2^n}$. These conditions allow us to generate, for each choice of $l$ and $k$, an infinite list of dimensions $n$ where $x^{e(l,k)}$ is 0-APN much more efficiently than in general. We observe that the Gold and Inverse exponents, as well as the inverses of the Gold exponents can be expressed in the form $e(l,k)$ for suitable $l$ and $k$. We characterize all cases in which $e(l,k)$ can be cyclotomic equivalent to a representative from the Gold, Kasami, Welch, Niho, and Inverse families of exponents. We characterize when $e(l,k)$ can lie in the same cyclotomic coset as the Dobbertin exponent (without considering inverses) and provide computational data showing that the Dobbertin inverse is never equivalent to $e(l,k)$. We computationally test the APN-ness of $e(l,k)$ for small values of $l$ and $k$ over $\mathbb{F}_{2^n}$ for $n \le 100$, and sketch the limits to which such tests can be performed using currently available technology. We conclude that there are no APN monomials among the tested functions, outside of known classes.
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 β€” math.NT

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