Factoring polynomials over finite fields with Drinfeld modules

DOI10.1090/S0025-5718-03-01598-9zbMath1040.11098OpenAlexW1997887705MaRDI QIDQ4433134

Gert-Jan van der Heiden

Publication date: 29 October 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01598-9

zbMATH Keywords

complexity

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Drinfel'd modules; higher-dimensional motives, etc. (11G09)

Related Items (2)

Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields ⋮ Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules

Cites Work

• On the number of matrices with given characteristic polynomial
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factoring polynomials over finite fields with Drinfeld modules