On Matrix Algebras Isomorphic to Finite Fields and Planar Dembowski-Ostrom Monomials
Christof Beierle, Patrick Felke

TL;DR
This paper presents a deterministic algorithm to identify when matrix algebras over finite fields are themselves finite fields and explores invariants of Dembowski-Ostrom polynomials, linking algebraic structures to finite field properties.
Contribution
It introduces a new algorithm for recognizing finite field structures within matrix algebras and analyzes invariants of DO polynomials related to finite field isomorphisms and semifield structures.
Findings
Algorithm decides if matrix algebra is a finite field in polynomial time.
Invariant set $ ext{Quot}( ext{D}_g)$ characterizes extended-affine equivalence of DO polynomials.
$ ext{Quot}( ext{D}_g)$ forms a field of order $p^n$ iff $g$ is equivalent to $x^2$.
Abstract
Let be a prime and a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra with is a finite field, performing at most elementary operations in . In the affirmative case, the algorithm returns a defining element so that . We then study an invariant for the extended-affine equivalence of Dembowski-Ostrom (DO) polynomials. More precisely, for a DO polynomial , we associate to a set of matrices with coefficients in , denoted , that stays invariant up to matrix similarity when applying extended-affine equivalence transformations to . In the case where is a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Topics in Algebra · graph theory and CDMA systems
