Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules
From MaRDI portal
Publication:1800711
DOI10.1016/j.ffa.2018.08.003zbMath1432.11179arXiv1504.07697OpenAlexW2963279844MaRDI QIDQ1800711
Publication date: 24 October 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07697
Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Drinfel'd modules; higher-dimensional motives, etc. (11G09) Arithmetic theory of polynomial rings over finite fields (11T55)
Related Items (2)
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology ⋮ Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Irreducible values of polynomials
- On finite Drinfeld modules
- Factoring integers with elliptic curves
- Isogenies of Drinfeld modules over finite fields
- Counting points on elliptic curves over finite fields
- Prime polynomials in short intervals and in arithmetic progressions
- Improved explicit estimates on the number of solutions of equations over a finite field
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Drinfeld Modules, Frobenius Endomorphisms, and CM-Liftings
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Subquadratic-time factoring of polynomials over finite fields
- Factoring polynomials over finite fields with Drinfeld modules
- Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Frobenius distributions of Drinfeld modules over finite fields
- The distribution of polynomials over finite fields
This page was built for publication: Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules