Quadratic Binomial APN Functions and Absolutely Irreducible Polynomials

Simple item page
dc.creatorByrne, E.
dc.creatorMcGuire, G.
dc.date2008-10-24
dc.date.accessioned2026-07-07T10:13:06Z
dc.date.available2026-07-07T10:13:06Z
dc.descriptionWe show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses the Weil bound from algebraic geometry.
dc.identifierhttps://arxiv.org/abs/0810.4523
dc.identifierhttp://arxiv.org/abs/0810.4523
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172410
dc.subjectNumber Theory
dc.subjectAlgebraic Geometry
dc.subjectCombinatorics
dc.titleQuadratic Binomial APN Functions and Absolutely Irreducible Polynomials
dc.typetext

Files

Collections

arXiv