Related papers: MNT Elliptic Curves with Non-Prime Order

This paper presents the Tate pairing computation on generalized Huff curves proposed by Wu and Feng. In fact, we extend the results of the Tate pairing computation on the standard Huff elliptic curves done previously by Joye, Tibouchi and…

The multiway-cut problem is, given a weighted graph and k >= 2 terminal nodes, to find a minimum-weight set of edges whose removal separates all the terminals. The problem is NP-hard, and even NP-hard to approximate within 1+delta for some…

Kaneko and Sakai recently observed that certain elliptic curves whose associated newforms (by the modularity theorem) are given by the eta-quotients can be characterized by a particular differential equation involving modular forms and…

We study elliptic curves of the form $x^3+y^3=2p$ and $x^3+y^3=2p^2$ where $p$ is any odd prime satisfying $p\equiv 2\bmod 9$ or $p\equiv 5\bmod 9$. We first show that the $3$-part of the Birch-Swinnerton-Dyer conjecture holds for these…

Using the theory of Diophantine m-tuples, i.e. sets with the property that the product of its any two distinct elements increased by 1 is a perfect square, we construct an elliptic curve over Q(t) of rank at least 4 with three non-trivial…

This paper is a follow up of arXiv:1702.02255 [math.NT]. We construct explicitly versal families of elliptic curves with rational points of order 4, 6, 8, 10, 12 respectively.

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…

We determine all possible degrees of cyclic isogenies of non-CM elliptic curves with rational $j$-invariant over number fields of degree $p$, where $p$ is an odd prime. The question had been answered for $p=2$, so this paper completes the…

Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and…

Fisher and Newton have given an explicit description of the Tate local pairing associated with the 3-torsion of an elliptic curve. The present paper summarizes the work from the author's master's thesis and gives an explicit formula for any…

Let $n$ be an integer such that $n = 5$ or $n \geq 7$. In this article, we introduce a recipe for a certain infinite family of non-singular plane curves of degree $n$ which violate the local-global principle. Moreover, each family contains…

Let $n>1$ be an integer such that $X_{0}\!\left( n\right) $ has genus $0$, and let $K$ be a field of characteristic $0$ or relatively prime to $6n$. In this article, we explicitly classify the isogeny graphs of all rational elliptic curves…

Edwards curves are a particular form of elliptic curves that admit a fast, unified and complete addition law. Relations between Edwards curves and Montgomery curves have already been described. Our work takes the view of parameterizing…

Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational…

We discuss the use of elliptic curves in cryptography on high-dimensional surfaces. In particular, instead of a Diffie-Hellman key exchange protocol written in the form of a bi-dimensional row, where the elements are made up with 256 bits,…

We use an invariant-theoretic method to compute certain twists of the modular curves X(n) for n=7,9,11. Searching for rational points on these twists enables us to find non-trivial pairs of n-congruent elliptic curves over Q, i.e. pairs of…

We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find…

Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…