How to compute an isogeny on the extended Jacobi quartic curves?

Computing isogenies between elliptic curves is a significantpart of post-quantum cryptography with many practicalapplications (for example, in SIDH, SIKE, B-SIDH, or CSIDHalgorithms). Comparing to other post-quantum algorithms, themain advantages of these protocols are smaller keys, the similaridea as in the ECDH, and a large basis of expertise aboutelliptic curves. The main disadvantage of the isogeny-basedcryptosystems is their computational efficiency - they are slowerthan other post-quantum algorithms (e.g., lattice-based). That iswhy so much effort has been put into improving the hithertoknown methods of computing isogenies between elliptic curves.In this paper, we present new formulas for computing isogeniesbetween elliptic curves in the extended Jacobi quartic formwith two methods: by transforming such curves into the shortWeierstrass model, computing an isogeny in this form and thentransforming back into an initial model or by computing anisogeny directly between two extended Jacobi quartics

The geometry of efficient arithmetic on elliptic curves

The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$ in $\mathbb{P}^r$. By means of a study of the finite dimensional vector spaces of global sections, we reduce the problem of constructing and finding efficiently computable polynomial maps defining the addition morphism or isogenies to linear algebra. We demonstrate the effectiveness of the method by improving the best known complexity for doubling and tripling, by considering families of elliptic curves admiting a $2$-torsion or $3$-torsion point

Lattice Polarized K3 Surfaces and Siegel Modular Forms

The goal of the present paper is two-fold. First, we present a classification of algebraic K3 surfaces polarized by the lattice H+E_8+E_7. Key ingredients for this classification are: a normal form for these lattice polarized K3 surfaces, a coarse moduli space and an explicit description of the inverse period map in terms of Siegel modular forms. Second, we give explicit formulas for a Hodge correspondence that relates these K3 surfaces to principally polarized abelian surfaces. The Hodge correspondence in question underlies a geometric two-isogeny of K3 surfaces

Computing isogenies between Jacobian of curves of genus 2 and 3

We present a quasi-linear algorithm to compute isogenies between Jacobians of curves of genus 2 and 3 starting from the equation of the curve and a maximal isotropic subgroup of the l-torsion, for l an odd prime number, generalizing the V\'elu's formula of genus 1. This work is based from the paper "Computing functions on Jacobians and their quotients" of Jean-Marc Couveignes and Tony Ezome. We improve their genus 2 case algorithm, generalize it for genus 3 hyperelliptic curves and introduce a way to deal with the genus 3 non-hyperelliptic case, using algebraic theta functions.Comment: 34 page

Analogue of Vélu\u27s Formulas for Computing Isogenies over Hessian Model of Elliptic Curves

Vélu\u27s formulas for computing isogenies over Weierstrass model of elliptic curves has been extended to other models of elliptic curves such as the Huff model, the Edwards model and the Jacobi model of elliptic curves. This work continues this line of research by providing efficient formulas for computing isogenies over elliptic curves of Hessian form. We provide explicit formulas for computing isogenies of degree 3 and isogenies of degree l not divisible by 3. The theoretical cost of computing these maps in this case is slightly faster than the case with other curves. We also extend the formulas to obtain isogenies over twisted and generalized Hessian forms of elliptic curves. The formulas in this work have been verified with the Sage software and are faster than previous results on the same curve

A Survey Report On Elliptic Curve Cryptography

The paper presents an extensive and careful study of elliptic curve cryptography (ECC) and its applications. This paper also discuss the arithmetic involved in elliptic curve  and how these curve operations is crucial in determining the performance of cryptographic systems. It also presents  different forms of elliptic curve in various coordinate system , specifying which is most widely used and why. It also explains how isogenenies between elliptic curve  provides the secure ECC. Exentended form of elliptic curve i.e hyperelliptic curve has been presented here with its pros and cons. Performance of ECC and HEC is also discussed based on scalar multiplication and DLP. Keywords: Elliptic curve cryptography (ECC), isogenies, hyperelliptic curve (HEC) , Discrete Logarithm Problem (DLP), Integer  Factorization , Binary Field, Prime FieldDOI:http://dx.doi.org/10.11591/ijece.v1i2.8

Explicit Methods in Number Theory

These notes contain extended abstracts on the topic of explicit methods in number theory. The range of topics includes asymptotics for field extensions and class numbers, random matrices and L-functions, rational points on curves and higher-dimensional varieties, and aspects of lattice basis reduction

Elliptic Curves over Real Quadratic Fields are Modular

We prove that all elliptic curves defined over real quadratic fields are modular.Comment: 38 pages. Magma scripts available as ancillary files with this arXiv versio

Torsion Subgroups of Rational Elliptic Curves Over Odd Degree Galois Fields

The Mordell-Weil Theorem states that if K is a number field and E/K is an elliptic curve that the group of K-rational points E(K) is a finitely generated abelian group, i.e. E(K) = Z^{r_K} ⊕ E(K)_tors, where r_K is the rank of E and E(K)_tors is the subgroup of torsion points on E. Unfortunately, very little is known about the rank r_K. Even in the case of K = Q, it is not known which ranks are possible or if the ranks are bounded. However, there have been great strides in determining the sets E(K)_tors. Progress began in 1977 with Mazur\u27s classification of the possible torsion subgroups E(Q)_tors for rational elliptic curves, and there has since been an explosion of classifications. Inspired by work of Chou, González Jiménez, Lozano-Robledo, and Najman, the purpose of this work is to classify the set Φ_Q^{Gal}(9), i.e. the set of possible torsion subgroups for rational elliptic curves over nonic Galois fields. We not only completely determine the set Φ_Q^{Gal}(9), but we also determine the possible torsion subgroups based on the isomorphism type of Gal(K/Q). We then determine the possibilities for the growth of torsion from E(Q)_tors to E(K)_tors, i.e. what the possibilities are for E(K)_tors ⊇ E(Q)_tors given a fixed torsion subgroup E(Q)_tors. Extending the techniques used in the classification of Φ_Q^{Gal}(9), we then determine the possible structures over all odd degree Galois fields. Finally, we explicitly determine the sets Φ_Q^{Gal}(d) for all odd d based on the prime factorization for d while proving a number of other related results