Related papers: Efficient computation of universal elliptic Gau{\s…
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication…
In this paper we present a conjecture on the construction of generalised elliptic units above number fields with exactly one complex place. These elliptic units obtained as values of multiple elliptic Gamma functions. These form a…
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 introduce a method that is based on Fourier series expansions related to Jacobi elliptic functions and that we apply to determine new identities for evaluating hyperbolic infinite sums in terms of the complete elliptic integrals $K$ and…
In this recreative piece of work, we present Gauss' calendar formula with some examples to demonstrate how it is applied. Then, based on it, we give a formula for determining dates of particular week days of a given month, and some examples…
We derive a number of local identities of arbitrary rank involving Jacobi elliptic functions and use them to obtain several new results. First, we present an alternative, simpler derivation of the cyclic identities discovered by us…
Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)termination of programs operating on integers. To this end, a variety of acceleration techniques has been proposed. However, all of them are monolithic:…
The rationality of the elliptic Gauss sum coefficient is shown. The following is a specific case of our argument. Let f(u)=sl((1-i)\varpi u), where sl() is the Gauss' lemniscatic sine and \varpi=2.62205... is the real period of the elliptic…
By introducing a class of meromorphic functions with certain ramification structures on $\Bbb{CP}^1$, a new method for the determination of the Legendre representation of elliptic curves with complex multiplication is introduced. These…
The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should…
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…
We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…
We present a fast Gauss transform in one dimension using nearly optimal sum-of-exponentials approximations of the Gaussian kernel. For up to about ten-digit accuracy, the approximations are obtained via best rational approximations of the…
In this paper, we prove two structural theorems on the general Berndt-type integrals with the denominator having arbitrary positive degrees by contour integrations involving hyperbolic and trigonometric functions, and hyperbolic sums…
We put together some known theoretical results and the fact that certain computations can be done efficiently in SAGE to come up with a fast algorithm for calculating congruence primes linking a newform with integer coefficients (i.e. a…
In this article, we explore a series of elementary yet insightful results involving integrals related to Gaussian sums. Using techniques rooted in classical calculus, we derive several identities and evaluate nontrivial definite integrals…
Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
We study the iterative algorithm proposed by S. Armstrong, A. Hannukainen, T. Kuusi, J.-C. Mourrat to solve elliptic equations in divergence form with stochastic stationary coefficients. Such equations display rapidly oscillating…