Results 31 to 40 of about 4,641 (196)
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
Faster computation of isogenies of large prime degree [PDF]
Let $\mathcal{E}/\mathbb{F}_q$ be an elliptic curve, and $P$ a point in $\mathcal{E}(\mathbb{F}_q)$ of prime order $\ell$. Velu's formulae let us compute a quotient curve $\mathcal{E}' = \mathcal{E}/\langle{P}\rangle$ and rational maps defining a ...
D. J. Bernstein +3 more
semanticscholar +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 +4 more sources
Explicit isogenies of prime degree over number fields [PDF]
We provide an explicit and algorithmic version of a theorem of Momose classifying isogenies of prime degree of elliptic curves over number fields, which we implement in Sage and PARI/GP.
Barinder S. Banwait, M. Derickx
semanticscholar +1 more source
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
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
Modular isogeny complexes [PDF]
Minor revisions for ...
openaire +3 more sources

