相关论文: Constructing elliptic curves in almost polynomial …
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…
Let $X$ be a smooth projective curve over a finite field $\mathbb{F}$ with $q$ elements. For $m\geq 1,$ let $X_m$ be the curve $X$ over the finite field $\mathbb{F}_m$, the $m$-th extension of $\mathbb{F}.$ Let $K_n(m)$ be the $K$-group…
For a prime $p{\,>\,}3$ and a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$ with ${j(E)\notin\{0,1728\}}$, consider an endomorphism $\alpha$ of $E$ represented as a composition of $L$ isogenies of degree at most $d$. We…
Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…
We present an algorithm that, for every fixed degree $n\ge 3$, will enumerate all degree-$n$ places of the projective line over a finite field $k$ up to the natural action of $\operatorname{PGL}_2(k)$ using $O(\log q)$ space and…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
Positive semidefinite programs are an important subclass of semidefinite programs in which all matrices involved in the specification of the problem are positive semidefinite and all scalars involved are non-negative. We present a parallel…
$\newcommand{\popt}{{\mathcal{p}}} \newcommand{\Re}{\mathbb{R}}\newcommand{\N}{{\mathcal{N}}} \newcommand{\BX}{\mathcal{B}} \newcommand{\bb}{\mathsf{b}} \newcommand{\eps}{\varepsilon} \newcommand{\polylog}{\mathrm{polylog}} $ Let…
The fast marching algorithm computes an approximate solution to the eikonal equation in O(N log N) time, where the factor log N is due to the administration of a priority queue. Recently, Yatziv, Bartesaghi and Sapiro have suggested to use…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness…
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and…
We develop the first quantum algorithm for the constrained portfolio optimization problem. The algorithm has running time $\widetilde{O} \left( n\sqrt{r} \frac{\zeta \kappa}{\delta^2} \log \left(1/\epsilon\right) \right)$, where $r$ is the…
Let $E$ be an elliptic curve over a finite field $\mathbb{F}_q$ where $q$ is a prime power. The Schoof--Elkies--Atkin (SEA) algorithm is a standard method for counting the number of $\mathbb{F}_q$-points on $E$. The asymptotic complexity of…
We give a deterministic polynomial space construction for nearly optimal eps-nets with respect to any input n-dimensional convex body K and norm |.|. More precisely, our algorithm can build and iterate over an eps-net of K with respect to…
We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…
For an elliptic curve E/Q without complex multiplication we study the distribution of Atkin and Elkies primes l, on average, over all good reductions of E modulo primes p. We show that, under the Generalised Riemann Hypothesis, for almost…