Factorising Polynomials over Finite Fields
Amalaswintha Wolfsdorf
TL;DR
This paper presents a deterministic algorithm for factoring degree 2 polynomials over finite fields under specific conditions, advancing the computational methods in algebraic structures.
Contribution
It introduces a new deterministic algorithm for factoring quadratic polynomials over finite fields, which was not previously available.
Findings
Algorithm successfully factors polynomials under certain conditions
Improves deterministic methods for polynomial factorization
Potential applications in coding theory and cryptography
Abstract
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
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 · Polynomial and algebraic computation · Advanced Differential Equations and Dynamical Systems