Results 61 to 70 of about 4,641 (196)
Abelian threefolds with imaginary multiplication
Abstract Let A$A$ be an abelian threefold defined over a number field K$K$ with potential multiplication by an imaginary quadratic field M$M$. Under mild assumptions on K$K$, if A$A$ has signature (2,1) and the multiplication by M$M$ is defined over KM$KM$, we attach to A$A$ an elliptic curve defined over K$K$ with potential complex multiplication by M$
Francesc Fité, Pip Goodman
wiley +1 more source
Prismatic F‐crystals and Wach modules
Abstract We show that the category of analytic/completed prismatic F-crystals$F\text{-crystals}$ on the absolute prismatic site of a small (unramified at p$p$) base ring is naturally equivalent to the category of relative Wach modules from the theory of (φ,Γ)-modules$(\varphi, \Gamma)\text{-modules}$.
Abhinandan
wiley +1 more source
Motivic mirror symmetry and χ$\chi$‐independence for Higgs bundles in arbitrary characteristic
Abstract We prove that the (twisted orbifold) motives of the moduli spaces of SLn$\mathrm{SL}_n$ and PGLn$\mathrm{PGL}_n$‐Higgs bundles of coprime rank and degree on a smooth projective curve over an algebraically closed field in which the rank is invertible are isomorphic in Voevodsky's triangulated category of motives.
Victoria Hoskins, Simon Pepin Lehalleur
wiley +1 more source
A Compact and Scalable Hardware/Software Co-design of SIKE
We present efficient and compact hardware/software co-design implementations of the Supersingular Isogeny Key Encapsulation (SIKE) protocol on field-programmable gate arrays (FPGAs).
Pedro Maat C. Massolino +3 more
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
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
On families of K3 surfaces with real multiplication
We exhibit large families of K3 surfaces with real multiplication, both abstractly, using lattice theory, the Torelli theorem and the surjectivity of the period map, as well as explicitly, using dihedral covers and isogenies.
Bert van Geemen, Matthias Schütt
doaj +1 more source
On the Security of Supersingular Isogeny Cryptosystems [PDF]
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 +4 more sources
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
Constant time lattice reduction in dimension 4 with application to SQIsign
In this paper we propose a constant time lattice reduction algorithm for integral dimension-4 lattices. Motivated by its application in the SQIsign postquantum signature scheme, we provide for the first time a constant time LLLlike algorithm with ...
Otto Hanyecz +4 more
doaj +1 more source

