Results 1 to 10 of about 61 (56)
An efficient post-quantum KEM from CSIDH
The SIDH and CSIDH are now the two most well-known post-quantum key exchange protocols from the supersingular isogeny-based cryptography, which have attracted much attention in recent years and served as the building blocks of other supersingular isogeny-
Mingping Qi
exaly +2 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.
Seokhie Hong, Donghoe Heo, Suhri Kim
exaly +3 more sources
On the Performance Analysis for CSIDH-Based Cryptosystems
In this paper, we present the performance and security analysis for various commutative SIDH (CSIDH)-based algorithms. As CSIDH offers a smaller key size than SIDH and provides a relatively efficient signature scheme, numerous CSIDH-based key exchange ...
Seokhie Hong +2 more
exaly +3 more sources
Optimized CSIDH Implementation Using a 2-Torsion Point
The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when ...
Seokhie Hong +2 more
exaly +3 more sources
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 𝒪).
Benjamin Pring +2 more
exaly +2 more sources
CTIDH: faster constant-time CSIDH
This paper introduces a new key space for CSIDH and a new algorithm for constant-time evaluation of the CSIDH group action. The key space is not useful with previous algorithms, and the algorithm is not useful with previous key spaces, but combining the ...
Gustavo Banegas +7 more
doaj +1 more source
РАНДОМІЗАЦІЯ АЛГОРИТМУ CSIDH НА КВАДРАТИЧНИХ ТА СКРУЧЕНИХ КРИВИХ ЕДВАРДА
Розглянуто властивості квадратичних і кручених суперсингулярних кривих Едвардса, які утворюють пари квадратичних кручень з порядком над простим полем. Розглянуто модифікацію алгоритму CSIDH на основі ізогеній непарного ступеня цих кривих.
Anatoliy Bessalov +2 more
doaj +1 more source
Torsion point attacks on ‘SIDH‐like’ cryptosystems
Abstract Isogeny‐based cryptography is a promising approach for post‐quantum cryptography. The best‐known protocol following that approach is the supersingular isogeny Diffie–Hellman protocol (SIDH); this protocol was turned into the CCA‐secure key encapsulation mechanism SIKE, which was submitted to and remains in the third round of NIST's post ...
Péter Kutas, Christophe Petit
wiley +1 more source
Complete Analysis of Implementing Isogeny-Based Cryptography Using Huff Form of Elliptic Curves
In this paper, we present the analysis of Huff curves for implementing isogeny-based cryptography. In this regard, we first investigate the computational cost of the building blocks when compression functions are used for Huff curves.
Suhri Kim
doaj +1 more source
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems.
J.‐F. Biasse +4 more
wiley +1 more source

