Related papers: Fast Elliptic Curve Arithmetic and Improved Weil P…
Numerical tools for computation of $\wp$-functions, also known as Kleinian, or multiply periodic, are proposed. In this connection, computation of periods of the both first and second kinds is reconsidered. An analytical approach to…
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…
We discuss a non-computational elementary approach to a well-known criterion of divisibility by 2 in the group of rational points on an elliptic curve.
In this paper, we derive a family of fast and stable algorithms for multiplying and inverting $n \times n$ Pascal matrices that run in $O(n log^2 n)$ time and are closely related to De Casteljau's algorithm for B\'ezier curve evaluation.…
Recently, the butterfly approximation scheme and hierarchical approximations have been proposed for the efficient computation of integral transforms with oscillatory and with asymptotically smooth kernels. Combining both approaches, we…
Division polynomials associated to an elliptic curve $E/K$ are polynomials $\phi_n, \psi_n^2$ that arise from the sequence of points $\{nP\}_{n \in \mathbb{N}}$ on this curve. If one wishes to study $\mathbb{Z}$--linear combination of…
Fix an integer $d>0$. In 2008, David and Weston showed that, on average, an elliptic curve over $\mathbf{Q}$ picks up a nontrivial $p$-torsion point defined over a finite extension $K$ of the $p$-adics of degree at most $d$ for only…
Efficient computations of pairings with Miller Algorithm have recently received a great attention due to the many applications in cryptography. In this work, we give formulae for the optimal Ate pairing in terms of elliptic nets associated…
We give examples of smooth plane quartics over $\mathbb{Q}$ with complex multiplication over $\overline{\mathbb{Q}}$ by a maximal order with primitive CM type. We describe the required algorithms as we go, these involve the reduction of…
In this article, we study the cyclicity problem of elliptic curves $E/\Bbb{Q}$ modulo primes in a given arithmetic progression. We extend the recent work of Akbal and G\"ulo\u{g}lu by proving an unconditional asymptotic for such a cyclicity…
The Langlands Programme predicts that a weight 2 newform f over a number field K with integer Hecke eigenvalues generally should have an associated elliptic curve E_f over K. In our previous paper, we associated, building on works of Darmon…
The use of integral equation methods for the efficient numerical solution of PDE boundary value problems requires two main tools: quadrature rules for the evaluation of layer potential integral operators with singular kernels, and fast…
It is known that the multiplication of an $N \times M$ matrix with an $M \times P$ matrix can be performed using fewer multiplications than what the naive $NMP$ approach suggests. The most famous instance of this is Strassen's algorithm for…
Studying the computational complexity and designing fast algorithms for determining winners under voting rules are classical and fundamental questions in computational social choice. In this paper, we accelerate voting by leveraging quantum…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
Wave-CAIPI MR imaging is a 3D imaging technique which can uniformize the g-factor maps and significantly reduce g-factor penalty at high acceleration factors. But it is time-consuming to calculate the average g-factor penalty for optimizing…
The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…
We give explicit low-rank bilinear non-commutative schemes for multiplying structured $n \times n$ matrices with $2 \leq n \leq 5$, which serve as building blocks for recursive algorithms with improved multiplicative factors in asymptotic…
An open-source C++ framework for discovering fast matrix multiplication schemes using the flip graph approach is presented. The framework supports multiple coefficient rings -- binary ($\mathbb{Z}_2$), modular ternary ($\mathbb{Z}_3$) and…
In this article we give explicit formulae for a lift of the relative Frobenius morphism between elliptic curves and show how one can compute this lift in the case of ordinary reduction in odd characteristic. Our theory can also be used in…