Related papers: Isolated Curves for Hyperelliptic Curve Cryptograp…
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the…
An analysis is made of the properties and conditions for the existence of 3- and 5-isogenies of complete and quadratic supersingular Edwards curves. For the encapsulation of keys based on the SIDH algorithm, it is proposed to use isogeny of…
Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…
Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…
We show that for any elliptic curve (with j invariant not 0 or 1728) over any field of characteristic different from 2 and 3, there exists an hyperelliptic curve H of genus 5 with two independent maps to the given elliptic curve. We also…
Privacy Preserving Data Mining is a method which ensures privacy of individual information during mining. Most important task involves retrieving information from multiple data bases which is distributed. The data once in the data warehouse…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
We show that elliptic curves with complex multiplication (CM) naturally emerge in the spectral geometry of Hermitian one-matrix models in the two-cut phase. Focusing on a symmetric quartic potential, we derive the corresponding genus-one…
The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is foundational for isogeny-based cryptography. The One Endomorphism…
We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this problem a smaller quantum computer can solve problems further…
We study isolated points on the modular curves $X_{H}$, for $H$ a subgroup of $\operatorname{GL}_{2}(\mathbb{Z}/n \mathbb{Z})$ for some $n \geq 1$. In particular, we prove a single-sink theorem for such isolated points, which traces the…
Group-based cryptography is a relatively unexplored family in post-quantum cryptography, and the so-called Semidirect Discrete Logarithm Problem (SDLP) is one of its most central problems. However, the complexity of SDLP and its…
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 describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
In this paper, we study isogeny graphs of supersingular elliptic curves. Supersingular isogeny graphs were introduced as a hard problem into cryptography by Charles, Goren, and Lauter for the construction of cryptographic hash functions…
In cryptanalysis, solving the discrete logarithm problem (DLP) is key to assessing the security of many public-key cryptosystems. The index-calculus methods, that attack the DLP in multiplicative subgroups of finite fields, require solving…
The survey presents the evolution of Short Weierstrass elliptic curves after their introduction in cryptography. Subsequently, this evolution resulted in the establishment of present elliptic curve computational standards. We discuss the…
The CM class number one problem for elliptic curves asked to find all elliptic curves defined over the rationals with non-trivial endomorphism ring. For genus-2 curves it is the problem of determining all CM curves of genus $2$ defined over…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.