Results 21 to 30 of about 162 (153)
Towards Isogeny-Based Password-Authenticated Key Establishment
Journal of Mathematical Cryptology, 2020 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
Transactions on Cryptographic Hardware and Embedded Systems, 2023 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
The isogeny conjecture for A-motives [PDF]
Inventiones mathematicae, 2011 ISSN:1432 ...
openaire +2 more sources
Let us walk on the 3-isogeny graph: efficient, fast, and simple
Transactions on Cryptographic Hardware and Embedded SystemsConstructing and implementing isogeny-based cryptographic primitives is an active research. In particular, performing length-n isogenies walks over quadratic field extensions of Fp plays an exciting role in some constructions, including Hash functions ...
Jesús-Javier Chi-Domínguez +2 more
doaj +1 more source
Isolated elliptic curves and the MOV attack
Journal of Mathematical Cryptology, 2017 We present a variation on the CM method that produces elliptic curves over prime fields with nearly prime order that do not admit many efficiently computable isogenies. Assuming the Bateman–Horn conjecture, we prove that elliptic curves produced this way
Scholl Travis
doaj +1 more source
Transactions on Cryptographic Hardware and Embedded Systems, 2023 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
On the Security of Supersingular Isogeny Cryptosystems [PDF]
, 2016 We study cryptosystems based on supersingular isogenies. This is an active area of research in post-quantum cryptography. Our first contribution is to give a very powerful active attack on the supersingular isogeny encryption scheme. This attack can only be prevented by using a (relatively expensive) countermeasure.
Steven D. Galbraith +3 more
openaire +3 more sources
Wild conductor exponents of curves
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract We give an explicit formula for wild conductor exponents of plane curves over Qp$\mathbb {Q}_p$ in terms of standard invariants of explicit extensions of Qp$\mathbb {Q}_p$, generalising a formula for hyperelliptic curves. To do so, we prove a general result relating the wild conductor exponent of a simply branched cover of the projective line ...
Harry Spencer
wiley +1 more source
Mathematics of ComputationWe first give a cleaner and more direct approach to the derivation of the Fast model of the Kummer surface. We show how to construct efficient ( N ,
Corte-Real Santos, M, Flynn, EV
openaire +2 more sources
Counting 5‐isogenies of elliptic curves over Q$\mathbb {Q}$
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract We show that the number of 5‐isogenies of elliptic curves defined over Q$\mathbb {Q}$ with naive height bounded by H>0$H > 0$ is asymptotic to C5·H1/6(logH)2$C_5\cdot H^{1/6} (\log H)^2$ for some explicitly computable constant C5>0$C_5 > 0$. This settles the asymptotic count of rational points on the genus zero modular curves X0(m)$\mathcal {X}
Santiago Arango‐Piñeros +3 more
wiley +1 more source