Results 1 to 10 of about 2,168 (195)
Efficiency of SIDH-based signatures (yes, SIDH)
In this note, we assess the efficiency of a supersingular isogeny Diffie-Hellman (SIDH)-based digital signature built on a weaker variant of a recent identification protocol proposed by Basso et al.
Ghantous Wissam +2 more
doaj +1 more source
Efficient Commutative PQC Algorithms on Isogenies of Edwards Curves
The article presents the author’s works in the field of modifications and modeling of the Post-Quantum Cryptography (PQC) Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) algorithm on non-cyclic supersingular Edwards curves and its predecessor ...
Anatoly Bessalov +2 more
doaj +1 more source
Optimized SeaSign for Enhanced Efficiency
This paper optimized SeaSign – an isogeny-based digital signature algorithm that combines the class group actions of CSIDH with the notion of Fiat-Shamir with abort.
Suhri Kim
doaj +1 more source
Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians [PDF]
The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms-including Gallant-Lambert-Vanstone (GLV) and Galbraith-Lin-Scott (GLS) multiplication, as well as higher-dimensional and higher-
Smith, Benjamin
core +1 more source
Modular polynomials via isogeny volcanoes
We present a new algorithm to compute the classical modular polynomial Phi_n in the rings Z[X,Y] and (Z/mZ)[X,Y], for a prime n and any positive integer m. Our approach uses the graph of n-isogenies to efficiently compute Phi_n mod p for many primes p of
Broker, Reinier +2 more
core +1 more source
Paving the Way for SQIsign: Toward Efficient Deployment on 32-bit Embedded Devices
The threat of quantum computing has spurred research into post-quantum cryptography. SQIsign, a candidate submitted to the standardization process of the National Institute of Standards and Technology, is emerging as a promising isogeny-based signature ...
Yue Hu, Shiyu Shen, Hao Yang, Weize Wang
doaj +1 more source
On the Parallelization of Square-Root Vélu’s Formulas
A primary challenge in isogeny-based cryptography lies in the substantial computational cost associated to computing and evaluating prime-degree isogenies.
Jorge Chávez-Saab +2 more
doaj +1 more source
Cryptography based on elliptic curves is endowed with efficient methods for public-key cryptography. Recent research has shown the superiority of the Montgomery and Edwards curves over the Weierstrass curves as they require fewer arithmetic operations ...
Armando Faz Hernandez, Julio López
doaj +1 more source
Hard isogeny problems over RSA moduli and groups with infeasible inversion [PDF]
We initiate the study of computational problems on elliptic curve isogeny graphs defined over RSA moduli. We conjecture that several variants of the neighbor-search problem over these graphs are hard, and provide a comprehensive list of cryptanalytic ...
Altug, Salim Ali, Chen, Yilei
core +1 more source
Let us walk on the 3-isogeny graph: efficient, fast, and simple
Constructing 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

