Results 11 to 20 of about 113 (86)

Pairing Optimizations for Isogeny-Based Cryptosystems

IET Information Security
In isogeny-based cryptography, bilinear pairings are regarded as a powerful tool in various applications, including key compression, public key validation, and torsion basis generation. However, in most isogeny-based protocols, the performance of pairing
Shiping Cai, Kaizhan Lin, Chang-An Zhao
doaj   +2 more sources

Torsion point attacks on ‘SIDH‐like’ cryptosystems

IET Information Security, Volume 17, Issue 2, Page 161-170, March 2023., 2023
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

IET Information Security, Volume 17, Issue 2, Page 171-209, March 2023., 2023
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, X. Bonnetain, E. Kirshanova, A. Schrottenloher, F. Song   +4 more
wiley   +1 more source

Quantum Security Analysis of CSIDH [PDF]

, 2020
CSIDH is a recent proposal for post-quantum non-interactive key-exchange, presented at ASIACRYPT 2018. Based on supersingular elliptic curve isogenies, it is similar in design to a previous scheme by Couveignes, Rostovtsev and Stolbunov, but aims at an improved balance between efficiency and security.
Bonnetain, Xavier, Schrottenloher, André   +1 more
openaire   +1 more source

Disorientation Faults in CSIDH

, 2023
We investigate a new class of fault-injection attacks against the CSIDH family of cryptographic group actions. Our disorientation attacks effectively flip the direction of some isogeny steps. We achieve this by faulting a specific subroutine, connected to the Legendre symbol or Elligator computations performed during the evaluation of the group action.
Gustavo Banegas, Juliane Krämer, Tanja Lange 0001, Michael Meyer 0001, Lorenz Panny, Krijn Reijnders, Jana Sotáková, Monika Trimoska   +7 more
openaire   +7 more sources

CSIDH: An Efficient Post-Quantum Commutative Group Action [PDF]

, 2018
We propose an efficient commutative group action suitable for non-interactive key exchange in a post-quantum setting. Our construction follows the layout of the Couveignes–Rostovtsev–Stolbunov cryptosystem, but we apply it to supersingular elliptic curves defined over a large prime field Fp, rather than to ordinary elliptic curves.
Wouter Castryck, Tanja Lange 0001, Chloe Martindale, Lorenz Panny, Joost Renes   +4 more
openaire   +9 more sources

Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies [PDF]

, 2019
Choosing safe post-quantum parameters for the new CSIDH isogeny-based key-exchange system requires concrete analysis of the cost of quantum attacks. The two main contributions to attack cost are the number of queries in hidden-shift algorithms and the cost of each query.
Bernstein, Daniel J., Lange, Tanja, Martindale, Chloe, Panny, Lorenz   +3 more
openaire   +5 more sources

CSI-RAShi: Distributed Key Generation for CSIDH

, 2021
We present an honest-majority Distributed Key Generation protocol (DKG) based on Shamir’s (k, n)-threshold secret sharing in the setting of Very Hard Homogenous Spaces (VHHS). DKGs in the discrete logarithm setting use Pedersen commitments, for which there is no known analogue in the VHHS setting.
Beullens, Ward, Disson, Lucas, Pedersen, Robi, Vercauteren, Frederik   +3 more
openaire   +3 more sources

A Note on the Security of CSIDH

, 2018
We propose an algorithm for computing an isogeny between two elliptic curves $E_1,E_2$ defined over a finite field such that there is an imaginary quadratic order $\mathcal{O}$ satisfying $\mathcal{O}\simeq \operatorname{End}(E_i)$ for $i = 1,2$. This concerns ordinary curves and supersingular curves defined over $\mathbb{F}_p$ (the latter used in the ...
Jean-François Biasse, Annamaria Iezzi, Michael J. Jacobson Jr.   +2 more
openaire   +4 more sources

Orienting supersingular isogeny graphs

Journal of Mathematical Cryptology, 2020
We introduce a category of 𝓞-oriented supersingular elliptic curves and derive properties of the associated oriented and nonoriented ℓ-isogeny supersingular isogeny graphs.
Colò Leonardo, Kohel David
doaj   +1 more source