Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
From MaRDI portal
Publication:6081969
DOI10.1145/3597066.3597080arXiv2302.08611OpenAlexW4383213613MaRDI QIDQ6081969
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.08611
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Modular composition modulo triangular sets and applications
- On finite Drinfeld modules
- \(t\)-motives
- On fast multiplication of polynomials over arbitrary algebras
- On some characteristic polynomials attached to finite Drinfeld modules
- The Magma algebra system. I: The user language
- Fast operations on linearized polynomials and their applications in coding theory
- On the complexity of computing determinants
- 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
- Finding endomorphisms of Drinfeld modules
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Fast multivariate multi-point evaluation revisited
- Endomorphism rings of reductions of Drinfeld modules
- Computing Frobenius maps and factoring polynomials
- Elliptic periods for finite fields
- Modern Computer Algebra
- Frobenius actions on the de Rham cohomology of Drinfeld modules
- Faster Polynomial Multiplication over Finite Fields
- Fast Polynomial Factorization and Modular Composition
- Fast Algorithms for Manipulating Formal Power Series
- Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
- Fast Multiplication for Skew Polynomials
- Composition Modulo Powers of Polynomials
- Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module
- Frobenius distributions of Drinfeld modules over finite fields
- Public key cryptosystems based on Drinfeld modules are insecure
This page was built for publication: Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
