Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields

DOI10.1016/j.jsc.2020.06.007zbMath1459.11134arXiv1712.00669OpenAlexW3036011203WikidataQ114154457 ScholiaQ114154457MaRDI QIDQ1994892

Anand Kumar Narayanan, Javad Doliskani, Éric Schost

Publication date: 18 February 2021

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

Full work available at URL: https://arxiv.org/abs/1712.00669

zbMATH Keywords

polynomial factorizationcomplex multiplicationDrinfeld modulesHasse invariantelliptic modules

Mathematics Subject Classification ID

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

Related Items

Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology

Uses Software

• FLINT
• Magma
• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finite Drinfeld modules
• Matrix multiplication via arithmetic progressions
• Factoring integers with elliptic curves
• On the coefficients of Drinfeld modular forms
• On fast multiplication of polynomials over arbitrary algebras
• Some results on computational complexity
• Fast rectangular matrix multiplication and applications
• Deligne's congruence and supersingular reduction of Drinfeld modules
• The Magma algebra system. I: The user language
• On singular and supersingular invariants of Drinfeld modules
• Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules
• Computing Frobenius maps and factoring polynomials
• Fast Polynomial Factorization and Modular Composition
• Fast arithmetic for the algebraic closure of finite fields
• Powers of tensors and fast matrix multiplication
• Field Arithmetic
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Fast Algorithms for Manipulating Formal Power Series
• Subquadratic-time factoring of polynomials over finite fields
• Factoring polynomials over finite fields with Drinfeld modules
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
• Frobenius distributions of Drinfeld modules over finite fields
• Fast Library for Number Theory: An Introduction
• Fast construction of irreducible polynomials over finite fields
• Public key cryptosystems based on Drinfeld modules are insecure

This page was built for publication: Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields