Related papers: On Division Polynomial PIT and Supersingularity

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

We study generalisations to totally real fields of methods originating with Wiles and Taylor-Wiles. In view of the results of Skinner-Wiles on elliptic curves with ordinary reduction, we focus here on the case of supersingular reduction.…

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

We study the number of elliptic curves, up to isomorphism, over a fixed quartic field $K$ having a prescribed torsion group $T$ as a subgroup. Let $T=\Z/m\Z \oplus \Z/n\Z$, where $m|n$, be a torsion group such that the modular curve…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…

We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for…

In this paper we study genus-$4$ curves obtained as double covers of elliptic curves. Firstly we shall give explicit defining equations of such curves with explicit criterion for whether it is nonsingular, and show the irreducibility of the…

Let $q > 5$ be a prime and $K$ a quadratic number field. In this article we extend a previous result of Najman and the author and prove that if $E/K$ is an elliptic curve with potentially multiplicative reduction at all primes $\mathfrak q…

For a prime $p>3$, let $D$ be the discriminant of an imaginary quadratic order with $|D|< \frac{4}{\sqrt{3}}\sqrt{p}$. We research the solutions of the class polynomial $H_D(X)$ mod $p$ in $\mathbb{F}_p$ if $D$ is not a quadratic residue in…

In this paper we consider elliptic divisibility sequences generated by a point on an elliptic curve over $\mathbb{Q}$ with $j$-invariant $1728$ given by an integral short Weierstrass equation. For several different such elliptic…

Let $K$ be a field of characteristic different from $2$ and let $E$ be an elliptic curve over $K$, defined either by an equation of the form $y^{2} = f(x)$ with degree $3$ or as the Jacobian of a curve defined by an equation of the form…

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…

We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…

We first show a deterministic algorithm for taking $r$-th roots over $\F_q$ without being given any $r$-th nonresidue, where $\F_q$ is a finite field with $q$ elements and $r$ is a small prime such that $r^2$ divides of $q-1$. As…

For every elliptic curve $E$ which has complex multiplication (CM) and is defined over a number field $F$ containing the CM field $K$, we prove that the family of $p^{\infty}$-division fields of $E$, with $p \in \mathbb{N}$ prime, becomes…

Let $E/\mathbb{Q}$ be an elliptic curve and let $p\ge 5$ be a prime of good supersingular reduction. We generalize results due to Meng Fai Lim proving Kida's formula and integrality results for characteristic elements of signed Selmer…

Polynomial Identity Testing (PIT) is a fundamental computational problem. The famous depth-$4$ reduction result by Agrawal and Vinay (FOCS 2008) has made PIT for depth-$4$ circuits an enticing pursuit. A restricted depth-4 circuit computing…

Let $E$ be an elliptic curve over $\mathbb{Q}$ which has multiplicative reduction at a fixed prime $p$. For each positive integer $n$ we put $K_n:=\mathbb{Q}(E[p^n])$. The aim of this paper is to extend the author's previous our results…

Let $E$ be an elliptic curve over the finite field $\mathbb{F}_p$, and $P \in E(\mathbb{F}_p)$ be an $\mathbb{F}_p$-rational point. We obtain nontrivial estimates for multiplicative character sums associated with the division polynomials…