Results 41 to 50 of about 290 (181)
Constructing elliptic curve isogenies in quantum subexponential time
Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew +2 more
doaj +1 more source
On the quaternion -isogeny path problem [PDF]
AbstractLet $\mathcal{O}$ be a maximal order in a definite quaternion algebra over $\mathbb{Q}$ of prime discriminant $p$, and $\ell $ a small prime. We describe a probabilistic algorithm which, for a given left $\mathcal{O}$-ideal, computes a representative in its left ideal class of $\ell $-power norm.
Kohel, David +3 more
openaire +5 more sources
Wild conductor exponents of curves
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
We present high-speed implementations of the post-quantum supersingular isogeny Diffie-Hellman key exchange (SIDH) and the supersingular isogeny key encapsulation (SIKE) protocols for 32-bit ARMv7-A processors with NEON support.
Hwajeong Seo +3 more
doaj +1 more source
Highly Vectorized SIKE for AVX-512
It is generally accepted that a large-scale quantum computer would be capable to break any public-key cryptosystem used today, thereby posing a serious threat to the security of the Internet’s public-key infrastructure.
Hao Cheng +3 more
doaj +1 more source
Counting 5‐isogenies of elliptic curves over Q$\mathbb {Q}$
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
The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them an important tool for computational number theorists and practitioners of elliptic curve cryptography. This expository paper recounts the theory behind these graphs and examines several recently developed algorithms that ...
openaire +2 more sources
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Pairing Optimizations for Isogeny-Based Cryptosystems
In isogeny-based cryptography, bilinear pairings are regarded as a powerful tool in various applications, including key compression, public key validation, and torsion basis generation. However, in most isogeny-based protocols, the performance of pairing
Shiping Cai, Kaizhan Lin, Chang-An Zhao
doaj +1 more source
Dual Isogenies and Their Application to Public-Key Compression for Isogeny-Based Cryptography
The isogeny-based protocols SIDH and SIKE have received much attention for being post-quantum key agreement candidates that retain relatively small keys. A recent line of work has proposed and further improved compression of public keys, leading to the inclusion of public-key compression in the SIKE proposal for Round 2 of the NIST Post-Quantum ...
Naehrig, M., Renes, J.
openaire +3 more sources

