Related papers: More constructing pairing-friendly elliptic curves…

In this paper, as a result of a theorem of Serre on congruence properties, a complete solution is given for an open question (see the text) presented recently by Kim, Koo and Park. Some further questions and results on similar types of…

This paper presents an overview of the use of elliptic curves in cryptography. The security of this cryptosystem is based on the discrete logarithm problem, which appears to be much harder compared to the discrete logarithm problem in other…

We present a detailed analysis of how to implement the computation of modular symbols for a given elliptic curve by using numerical approximations. This method turns out to be more efficient than current implementation as the conductor of…

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

Several local elliptic coordinates are used to build a new polyelliptic coordinate system which is orthogonal and admits the separation of variables. Such coordinate systems can give the exact solutions of some unsolved problems in quantum…

We compute twists of the modular curve $X(13)$ that parametrise the elliptic curves 13-congruent to a given elliptic curve. Searching for rational points on these twists enables us to find non-trivial pairs of 13-congruent elliptic curves…

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

We develop a graph-theoretic algorithm to compute the $\varphi$-Selmer group of the elliptic curve $E_b: y^2 = x^3 + bx$ over $\mathbb{Q}(i)$, where $b \in \mathbb{Z}[i]$ and $\varphi$ is a degree 2 isogeny of $E_b$. We associate to $E_b$ a…

The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in computational mathematics. Its solution is supposed to provide…

We provide explicit faithful re-embeddings for all hyperelliptic curves of genus at most three and an algorithmic way to construct them. Both in the faithful tropicalization algorithm and the proofs of correctness, we showcase OSCAR-methods…

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…

In this paper, we demonstrate the intimate relationships among some geometric figures and the families of elliptic curves with positive ranks. These geometric figures include \textit{\textbf{Heron triangles}}, \textit{\textbf{Brahmagupta…

Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…

In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…

We construct the quantum double ramification hierarchy associated with the Gromov-Witten theory of elliptic curves. We use results of Oberdieck and Pixton on the intersection numbers of the double ramification cycle, the Gromov-Witten…

We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…

For avoiding the exposure of plaintexts in cloud environments, some homomorphic hashing algorithms have been proposed to generate the hash value of each plaintext, and cloud environments only store the hash values and calculate the hash…

We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…