Related papers: A note on the security of CSIDH
Massively-parallel graph algorithms have received extensive attention over the past decade, with research focusing on three memory regimes: the superlinear regime, the near-linear regime, and the sublinear regime. The sublinear regime is…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
We give an algorithm for counting self-avoiding walks or self-avoiding polygons that runs in time $\exp(C\sqrt{n\log n})$ on 2-dimensional lattices and time $\exp(C_dn^{(d-1)/d}\log n)$ on $d$-dimensional lattices for $d>2$.
Let $\mathcal{O}$ be an order in the imaginary quadratic field $K$. For positive integers $M \mid N$, we determine the least degree of an $\mathcal{O}$-CM point on the modular curve $X(M,N)_{/K(\zeta_M)}$ and also on the modular curve…
The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…
In recent algorithms that use deformation in order to compute the number of points on varieties over a finite field, certain differential equations of matrices over p-adic fields emerge. We present a novel strategy to solve this kind of…
Fix an elliptic curve $E_0$ without CM and a non-isotrivial elliptic scheme over a smooth irreducible curve, both defined over the algebraic numbers. Consider the union of all images of a fixed finite-rank subgroup (of arbitrary rank) of…
Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One popular measure is the Fr\'echet distance. Since it was proposed by Alt and Godau in 1992, many variants and extensions have…
Asymptotics-based configuration-interaction (CI) methods [G. Friesecke and B. D. Goddard, Multiscale Model. Simul. 7, 1876 (2009)] are a class of CI methods for atoms which reproduce, at fixed finite subspace dimension, the exact…
We introduce the notion of isolated genus two curves. As there is no known efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap, the discrete log problem (DLP) cannot be efficiently…
Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on…
We present a hybrid asymptotic/numerical method for the accurate computation of single and double layer heat potentials in two dimensions. It has been shown in previous work that simple quadrature schemes suffer from a phenomenon called…
In this paper, we study isogeny graphs of supersingular elliptic curves. Supersingular isogeny graphs were introduced as a hard problem into cryptography by Charles, Goren, and Lauter for the construction of cryptographic hash functions…
The Fr\'echet distance provides a natural and intuitive measure for the popular task of computing the similarity of two (polygonal) curves. While a simple algorithm computes it in near-quadratic time, a strongly subquadratic algorithm…
We present a polynomial-time algorithm for online differentially private synthetic data generation. For a data stream within the hypercube $[0,1]^d$ and an infinite time horizon, we develop an online algorithm that generates a…
A more accurate, stable, finite-difference time-domain (FDTD) algorithm is developed for simulating Maxwell's equations with isotropic or anisotropic dielectric materials. This algorithm is in many cases more accurate than previous…
We perform logical and physical resource estimation for computing binary elliptic curve discrete logarithms using Shor's algorithm on fault-tolerant quantum computers. We adopt a windowed approach to design our circuit implementation of the…
We determine the possible degrees of cyclic isogenies defined over quadratic fields for non-CM elliptic curves with rational $j$-invariant.
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
Improving over an earlier construction by Kaye and Zalka, Maslov et al. describe an implementation of Shor's algorithm which can solve the discrete logarithm problem on binary elliptic curves in quadratic depth O(n^2). In this paper we show…