Related papers: The Q-curve construction for endomorphism-accelera…

Let l be a prime number and let E and E' be l-isogenous elliptic curves defined over Q. In this paper we determine the proportion of primes p for which E(F_p) is isomorphic to E'(F_p). Our techniques are based on those developed in…

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…

Assume $X$ is a variety for which the elliptic stable envelope exists. In this note we construct natural $q$-difference equations from the elliptic stable envelope of $X$. In examples, these equations coincide with the quantum difference…

Clustering financial assets based on return correlations is a fundamental task in portfolio optimization and statistical arbitrage. However, classical clustering methods often fall short when dealing with signed correlation structures,…

Let $E/\mathbb{Q}$ be a non-CM elliptic curve. Assuming GRH, we prove that, for a set of primes $p$ of density $1$, the absolute discriminant of the $\mathbb{F}_p$-endomorphism ring of the reduction of $E$ modulo $p$ is close to maximal.

An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same…

The paper analyzes a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the complexity of solving the underlying problem for the proposed system…

We present the first BLS12-381 elliptic curve pairing crypto-processor for Internet-of-Things (IoT) security applications. Efficient finite field arithmetic and algorithm-architecture co-optimizations together enable two orders of magnitude…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…

With the explosive growth of graph-structured data, graph databases have become a critical infrastructure for supporting large-scale and complex data analysis. Among various graph operations, shortest distance queries play a fundamental…

The automorphism group of an elliptic curve over an algebraically closed field is well known. However, for various applications in coding theory and cryptography, we usually need to apply automorphisms defined over a finite field. Although…

We compute equations for the families of elliptic curves 9-congruent to a given elliptic curve. We use these to find infinitely many non-trivial pairs of 9-congruent elliptic curves over Q, i.e. pairs of non-isogenous elliptic curves over Q…

We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…

The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several signcryption schemes are proposed throughout the years, each…

Given an elliptic curve ${\mathcal E}$ over a field $K$ it is a challenging problem to write down explicit elements of its endomorphism ring ${\rm End}({\mathcal E});$ the problem amounts to find all possible solutions to a functional…

We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…

The Lyness map is a birational map in the plane which provides one of the simplest discrete analogues of a Hamiltonian system with one degree of freedom, having a conserved quantity and an invariant symplectic form. As an example of a…

Let $E$ be an elliptic curve over $\Q$. It is well known that the ring of endomorphisms of $E_p$, the reduction of $E$ modulo a prime $p$ of ordinary reduction, is an order of the quadratic imaginary field $Q(\pi_p)$ generated by the…

A low storage algorithm for constructing isogenies between ordinary elliptic curves was proposed by Galbraith, Hess and Smart (GHS). We give an improvement of this algorithm by modifying the pseudorandom walk so that lower-degree isogenies…

We describe a simple, but effective, method for deriving families of elliptic curves, with high rank, all of whose members have the same torsion subgroup structure.