Results 31 to 40 of about 8,681 (237)
Computing low-degree isogenies in genus 2 with the Dolgachev-Lehavi method [PDF]
Let ell be a prime, and H a curve of genus 2 over a field k of characteristic not 2 or ell. If S is a maximal Weil-isotropic subgroup of Jac(H)[ell], then Jac(H)/S is isomorphic to the Jacobian of some (possibly reducible) curve X.
Smith, Benjamin
core +5 more sources
The isogeny conjecture for A-motives [PDF]
ISSN:1432 ...
openaire +4 more sources
Strategies and their evaluations play important roles in speeding up the computation of large smooth-degree isogenies. The concept of optimal strategies for such computation was introduced by De Feo et al., and virtually all implementations of isogeny ...
Kittiphon Phalakarn +3 more
doaj +1 more source
On certain isogenies between K3 surfaces [PDF]
The aim of this paper is to construct "special" isogenies between K3 surfaces, which are not Galois covers between K3 surfaces, but are obtained by composing cyclic Galois covers, induced by quotients by symplectic automorphisms.
Camere, Chiara, Garbagnati, Alice
core +3 more sources
Modular isogeny complexes [PDF]
Minor revisions for ...
openaire +5 more sources
Towards Isogeny-Based Password-Authenticated Key Establishment
Password authenticated key establishment (PAKE) is a cryptographic primitive that allows two parties who share a low-entropy secret (a password) to securely establish cryptographic keys in the absence of public key infrastructure.
Taraskin Oleg +3 more
doaj +1 more source
Optimized CSIDH Implementation Using a 2-Torsion Point
The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when ...
Donghoe Heo +4 more
doaj +1 more source
Isogeny in superstable groups [PDF]
We study and develop a notion of isogeny for superstable groups. We prove several fundamental properties of the notion and then use it to formulate and prove uniqueness results. Connections to existing model theoretic notions are explained.
openaire +3 more sources
We propose a novel approach that generalizes interleaved modular multiplication algorithms for the computation of sums of products over large prime fields. This operation has widespread use and is at the core of many cryptographic applications.
Patrick Longa
doaj +1 more source
Multiplicative isogeny estimates [PDF]
AbstractThe theory of isogeny estimates for Abelian varieties provides ‘additive bounds’ of the form ‘d is at most B’ for the degrees d of certain isogenies. We investigate whether these can be improved to ‘multiplicative bounds’ of the form ‘d divides B’.
openaire +3 more sources

