Factoring polynomials over finite fields with Drinfeld modules

DOI10.1090/S0025-5718-03-01598-9MaRDI QIDQ4433134zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Polynomial factorisation using Drinfeld modules
• 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
• Factoring polynomials over global fields. I
• Factoring polynomials over finite fields

Cites work

• A New Algorithm for Factoring Polynomials Over Finite Fields
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 1263873 (Why is no real title available?)
• On the number of matrices with given characteristic polynomial

Cited in

(6)

• Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules
• Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
• Polynomial factorisation using Drinfeld modules
• scientific article; zbMATH DE number 1254268 (Why is no real title available?)
• Factoring polynomials over finite fields
• Using zeta functions to factor polynomials over finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4433134)