Related papers: Factoring Polynomials over Finite Fields using Dri…

Let $\mathbb{F}$ denote an algebraically closed field with characteristic $0$, and let $q$ denote a nonzero scalar in $\mathbb{F}$ that is not a root of unity. Let $\mathbb{Z}_4$ denote the cyclic group of order $4$. Let $\square_q$ denote…

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…

The primary objective of this paper is to derive explicit formulas for rank one and rank two Drinfeld modules over a specific domain denoted by A. This domain corresponds to the projective line associated with an infinite place of degree…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

We give a global description of the Frobenius elements in the division fields of Drinfeld modules of rank $2$. We apply this description to derive a criterion for the splitting modulo primes of a class of non-solvable polynomials, and to…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

Let $A={\mathbb F}_q[t]$ be the polynomial ring over a finite field ${\mathbb F}_q$ and let $\phi $ and $\psi$ be $A-$Drinfeld modules. In this paper we consider the group ${\mathrm{Ext}}^1(\phi ,\psi )$ with the Baer addition. We show that…

For any rank 2 Drinfeld module rho defined over an algebraic function field, we consider its period matrix P, which is analogous to the period matrix of an elliptic curve defined over a number field. Suppose that the characteristic of F_q…

We give asymptotics for the number of Drinfeld $\mathbb{F}_q[T]$-modules over $\mathbb{F}_q(T)$ of a given height, which satisfy prescribed sets of local conditions. This is done by relating our problem to a problem about counting points on…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an…

We present a polynomial-time pseudo-deterministic algorithm for constructing irreducible polynomial of degree $d$ over finite field $\mathbb{F}_q$. A pseudo-deterministic algorithm is allowed to use randomness, but with high probability it…

This article is divided in two parts. In the first part we endow a certain ring of ``Drinfeld quasi-modular forms'' for $\GL_2(\FF_q[T])$ (where $q$ is a power of a prime) with a system of "divided derivatives" (or hyperderivations). This…

We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…

Let $A$ be a Dedekind domain, $K$ the fraction field, $\p$ a non-zero prime ideal of $A$, and $K_\pp$ the completion of $K$ with respect to the $\p$-adic topology. At the input of a monic irreducible separable polynomial, $f(x)\in A[x]$,…

We work with detail the Drinfeld module over the ring $$A=F_2[x,y]/(y^2+y=x^3+x+1).$$ The example in question is one of the four examples that come from quadratic imaginary fields with class number $h = 1$ and rank one. We develop specific…

When travelling from the number fields theory to the function fields theory, one cannot miss the deep analogy between rank 1 Drinfeld modules and the group of root of unity and the analogy between rank 2 Drinfeld modules and elliptic…