Results 1 to 10 of about 1,931 (172)
We consider the genus-one curves which arise in the cuts of the sunrise and in the elliptic double-box Feynman integrals. We compute and compare invariants of these curves in a number of ways, including Feynman parametrization, lightcone and Baikov (in ...
Hjalte Frellesvig +3 more
doaj +6 more sources
Practical Usage of Radical Isogenies for CSIDH
Recently, a radical isogeny was proposed to boost commutative supersingular isogeny Diffie–Hellman (CSIDH) implementation. Radical isogenies reduce the generation of a kernel of a small prime order when implementing CSIDH.
Donghoe Heo, Suhri Kim, Seokhie Hong
doaj +2 more sources
Isogenies on twisted Hessian curves [PDF]
Elliptic curves are typically defined by Weierstrass equations. Given a kernel, the well-known Vélu's formula shows how to explicitly write down an isogeny between Weierstrass curves. However, it is not clear how to do the same on other forms of elliptic
Perez Broon Fouazou Lontouo +3 more
doaj +2 more sources
Towards Quantum-Resistant Cryptosystems From Supersingular Elliptic Curve Isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main technical idea in our scheme is that we transmit the images of torsion bases
David Jao, Luca De Feo
exaly +2 more sources
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.
David Jao, Andrew Childs
exaly +2 more sources
Verifiable delay functions and delay encryptions from hyperelliptic curves
Verifiable delay functions (VDFs) and delay encryptions (DEs) are two important primitives in decentralized systems, while existing constructions are mainly based on time-lock puzzles.
Chao Chen, Fangguo Zhang
doaj +1 more source
Review of Chosen Isogeny-Based Cryptographic Schemes
Public-key cryptography provides security for digital systems and communication. Traditional cryptographic solutions are constantly improved, e.g., to suppress brute-force attacks.
Bartosz Drzazga, Łukasz Krzywiecki
doaj +1 more source
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

