Related papers: Faster computation of the Tate pairing
Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…
The best method for computing the adjoint matrix of an order $n$ matrix in an arbitrary commutative ring requires $O(n^{\beta+1/3}\log n \log \log n)$ operations, provided the complexity of the algorithm for multiplying two matrices is…
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…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
We define the doubling zeta integral for smooth families of representations of classical groups. Following this we prove a rationality result for these zeta integrals and show that they satisfy a functional equation. Moreover, we show that…
We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is…
In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably…
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
We present new representations of Gauss--Legendre polynomials and their derivatives in the shifted power basis and in bases related to symmetric orthogonal Jacobi polynomials. Using these representations and certain recurrence relations, we…
We give a geometric interpretation of the group law for Jacobian varieties by extending the geometric construction of chords and tangents on an elliptic curve. For any given algebraic curve $\mathcal X$ and reduced divisors $D_1, D_2 \in…
We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.
We describe an algorithmic reduction of the search for integral points on a curve y^2 = ax^4 + bx^2 + c with nonzero ac(b^2-4ac) to solving a finite number of Thue equations. While existence of such reduction is anticipated from arguments…
We give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can…
We show that the number of copies of ${\Bbb Q}_p/{\Bbb Z}_p$ in the Tate-Shafarevich group of an elliptic curve $E$ over ${\Bbb Q}$ with complex multipication, is at most $2p - g$, where $g$ is the rank of $E({\Bbb Q})$, and for all…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We show that Euler's relation and the Taxi-Cab relation are both solutions of the same equation. General solutions of sums of two consecutive cubes equaling the sum of two other cubes are calculated. There is an infinite number of relations…
${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…
In this paper, we contribute operator-splitting methods improved by the Zassenhaus product for the numerical solution of linear partial differential equations. We address iterative splitting methods, that can be improved by means of the…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
A self-learning algebraic multigrid method for dominant and minimal singular triplets and eigenpairs is described. The method consists of two multilevel phases. In the first, multiplicative phase (setup phase), tentative singular triplets…