Results 1 to 10 of about 1,022 (119)
CTIDH: faster constant-time CSIDH [PDF]
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 +8 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 +3 more sources
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-
Qi Mingping
doaj +3 more sources
Batching CSIDH Group Actions using AVX-512
Commutative Supersingular Isogeny Diffie-Hellman (or CSIDH for short) is a recently-proposed post-quantum key establishment scheme that belongs to the family of isogeny-based cryptosystems.
Hao Cheng +4 more
doaj +5 more sources
РАНДОМІЗАЦІЯ АЛГОРИТМУ CSIDH НА КВАДРАТИЧНИХ ТА СКРУЧЕНИХ КРИВИХ ЕДВАРДА
Розглянуто властивості квадратичних і кручених суперсингулярних кривих Едвардса, які утворюють пари квадратичних кручень з порядком над простим полем. Розглянуто модифікацію алгоритму CSIDH на основі ізогеній непарного ступеня цих кривих.
Anatoliy Bessalov +2 more
doaj +4 more sources
ЯК ПОБУДУВАТИ CSIDH НА КВАДРАТИЧНИХ І СКРУЧЕНИХ КРИВИХ ЕДВАРДСА
В одної з відомих робіт виявлені некоректна постановка і невірне рішення задачі імплементації алгоритму CSIDH на кривих Едвардса . Дана розгорнена критика цієї роботи с доведенням неспроможності її концепції.
Anatoliy Bessalov
doaj +4 more sources
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
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
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
How to Compute an Isogeny on the Extended Jacobi Quartic Curves? [PDF]
Computing isogenies between elliptic curves is a significant part of post-quantum cryptography with many practical applications (for example, in SIDH, SIKE, B-SIDH, or CSIDH algorithms).
Łukasz Dzierzkowski, Michał Wroński
doaj +1 more source

