Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions

Details Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions

2009-03-11

arxiv.org/abs/0903.2016v4

Computer Science

Information Theory

Scientific paper

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect Nonlinear) over $\mathbb{F}_{2^n}$ for infinitely many values of $n$. Equivalently, $t$ is exceptional if the binary cyclic code of length $2^n-1$ with two zeros $\omega, \omega^t$ has minimum distance 5 for infinitely many values of $n$. The conjecture we prove states that every exceptional number has the form $2^i+1$ or $4^i-2^i+1$.

Affiliated with

Also associated with

No associations

Rating

Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124277