Bounds on the degree of APN polynomials The Case of $x^{-1}+g(x)$
| dc.creator | Leander, Gregor | |
| dc.creator | Rodier, François | |
| dc.date | 2009-01-27 | |
| dc.date.accessioned | 2026-07-07T12:34:56Z | |
| dc.date.available | 2026-07-07T12:34:56Z | |
| dc.description | We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form $f(x)=x^{-1}+g(x)$ where $g$ is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthermore we prove that when the degree of $g$ is less then 7 such functions are APN only if $m \le 3$ where these functions are equivalent to $x^3$. | |
| dc.identifier | https://arxiv.org/abs/0901.4322 | |
| dc.identifier | http://arxiv.org/abs/0901.4322 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/217619 | |
| dc.subject | Algebraic Geometry | |
| dc.subject | Cryptography and Security | |
| dc.title | Bounds on the degree of APN polynomials The Case of $x^{-1}+g(x)$ | |
| dc.type | text |