Results 11 to 20 of about 162 (153)
Proving knowledge of isogenies: a survey
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ward Beullens +3 more
openaire +4 more sources
Derived isogenies and isogenies for abelian surfaces
In this paper, we study the twisted Fourier-Mukai partners of abelian surfaces. Following the work of Huybrechts [doi:10.4171/CMH/465], we introduce the twisted derived equivalence between abelian surfaces. We show that there is a twisted derived Torelli theorem for abelian surfaces over algebraically closed fields with characteristic $\neq 2,3$.
Li, Zhiyuan, Zou, Haitao
openaire +2 more sources
An Efficient Signature Scheme From Supersingular Elliptic Curve Isogenies
Since supersingular elliptic curve isogenies are one of the several candidate sources of hardness for building post-quantum cryptographic primitives, the research of efficient signature schemes based on them is still a hot topic.
Yan Huang +3 more
doaj +1 more source
A trade-off between classical and quantum circuit size for an attack against CSIDH
We propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order đť’Ş).
Biasse Jean-François +4 more
doaj +1 more source
Algebraic approaches for solving isogeny problems of prime power degrees
Recently, supersingular isogeny cryptosystems have received attention as a candidate of post-quantum cryptography (PQC). Their security relies on the hardness of solving isogeny problems over supersingular elliptic curves. The meet-in-the-middle approach
Takahashi Yasushi +5 more
doaj +1 more source
On the supersingular GPST attack
The main attack against static-key supersingular isogeny Diffie–Hellman (SIDH) is the Galbraith–Petit–Shani–Ti (GPST) attack, which also prevents the application of SIDH to other constructions such as non-interactive key-exchange.
Basso Andrea, Pazuki Fabien
doaj +1 more source
Optimal Strategies for Computation of Degree â„“n Isogenies for SIDH [PDF]
This article presents methods and algorithms for the computation of isogenies of degree â„“n. Some of these methods are obtained using recurrence equations and generating functions.
Michał Wroński, Andrzej Chojnacki
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
Modular isogeny complexes [PDF]
Minor revisions for ...
openaire +3 more sources
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

