Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bounds on the degree of APN polynomials The Case of $x^{-1}+g(x)$ (0901.4322v1)

Published 27 Jan 2009 in math.AG and cs.CR

Abstract: We prove that functions $f:\f{2m} \to \f{2m}$ 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{2m}$. 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 $x3$.

Citations (4)

Summary

We haven't generated a summary for this paper yet.