Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
From MaRDI portal
Publication:2719077
DOI10.1090/S0025-5718-00-01233-3zbMath1003.11057OpenAlexW2056445329MaRDI QIDQ2719077
Publication date: 14 May 2001
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01233-3
Related Items (3)
Composed products and factors of cyclotomic polynomials over finite fields ⋮ Some subgroups of $mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1inmathbb{F}_q[x$] ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis
- Uniform cyclotomy
- Generalized riemann hypothesis and factoring polynomials over finite fields
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Period polynomials and Gauss sums for finite fields
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Cyclotomy, Higher Congruences, and Waring's Problem
This page was built for publication: Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields