相关论文: Fast Elliptic Curve Arithmetic and Improved Weil P…

We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…

Under the guidance of the general theory developed for classical partial differential equations (PDEs), we investigate the Riesz bases of wavelets in the spaces where fractional PDEs usually work, and their applications in numerically…

We study the Weil representation $\rho$ of a curve over a $p$-adic field with potential reduction of compact type. We show that $\rho$ can be reconstructed from its stable reduction. For superelliptic curves of the form $y^n=f(x)$ at primes…

We prove new sharp asymptotic for counting the semistable elliptic curves with two marked Weierstrass points at $\infty$ and $0$ and also the cases where $0$ is a 2-torsion or a 3-torsion marked Weierstrass point over $\mathbb{F}_q(t)$ by…

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…

Given a prime q and a negative discriminant D, the CM method constructs an elliptic curve E/\Fq by obtaining a root of the Hilbert class polynomial H_D(X) modulo q. We consider an approach based on a decomposition of the ring class field…

The Numerical Recipes series of books are a useful resource, but all the algorithms they contain cannot be used within open-source projects. In this paper we develop drop-in alternatives to the two algorithms they present for cubic spline…

Optimized multiple precision basic linear computation, especially matrix multiplication, is crucial for solving ill-conditioned problems. The recently proposed Ozaki scheme, which implements accurate matrix multiplication using existing…

We present a method for constructing optimized equations for the modular curve X_1(N) using a local search algorithm on a suitably defined graph of birationally equivalent plane curves. We then apply these equations over a finite field F_q…

We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…

Let p>3 be a prime and let E, E' be supersingular elliptic curves over F_p. We want to construct an isogeny phi: E --> E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by…

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and…

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…

We develop a Frank-Wolfe algorithm with corrective steps, generalizing previous algorithms including blended conditional gradients, blended pairwise conditional gradients, and fully-corrective Frank-Wolfe. For this, we prove tight…

The fast multipole method (FMM) performs fast approximate kernel summation to a specified tolerance $\epsilon$ by using a hierarchical division of the domain, which groups source and receiver points into regions that satisfy local…

It is true that different approaches have been utilised to accelerate the computation of discrete logarithm problem on elliptic curves with Pollard's Rho method. However, trapping in cycles fruitless will be obtained by using the random…

In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that…

We explicitly compute the Cassels-Tate pairing on the 2-Selmer group of an elliptic curve using the Albanese-Albanese definition of the pairing given by Poonen and Stoll. This leads to a new proof that a pairing defined by Cassels on the…

Numeric modeling of electromagnetics and acoustics frequently entails matrix-vector multiplication with block Toeplitz structure. When the corresponding block Toeplitz matrix is not highly sparse, e.g. when considering the electromagnetic…