Results 31 to 40 of about 356 (107)
Low Memory Attacks on Small Key CSIDH [PDF]
Despite recent breakthrough results in attacking SIDH, the CSIDH protocol remains a secure post-quantum key exchange protocol with appealing properties. However, for obtaining efficient CSIDH instantiations one has to resort to small secret keys. In this
Sabrina Kunzweiler +3 more
core +3 more sources
CSIDH with Level Structure [PDF]
We construct a new post-quantum cryptosystem which consists of enhancing CSIDH and similar cryptosystems by adding a full level $N$ structure. We discuss the size of the isogeny graph in this new cryptosystem which consists of components which are acted ...
José Felipe Voloch +2 more
core +2 more sources
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH [PDF]
We present the first round-optimal and plausibly quantum-safe oblivious transfer (OT) and multi-party computation (MPC) protocols from the computational CSIDH assumption - the weakest and most widely studied assumption in the CSIDH family of isogeny ...
Pratik Sarkar +5 more
core +3 more sources
An Analysis of Fault Attacks on CSIDH [PDF]
CSIDH is an isogeny-based post-quantum key establishment protocol proposed in 2018. In this work, we analyze attacking implementations of CSIDH which use dummy isogeny operations using fault injections from a mathematical perspective. We detail an attack
Jason LeGrow, Aaron Hutchinson
core +2 more sources
Mathematical and computational aspects of CSIDH-based algorithms
Mathematical and Computational Aspects of CSIDH-based ...
Luciano Maino +3 more
core +2 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
How to construct CSIDH on Edwards curves [PDF]
CSIDH is an isogeny-based key exchange protocol proposed by Castryck et al. in 2018. It is based on the ideal class group action on Fp -isomorphism classes of Montgomery curves.
Takagi, Tsuyoshi +5 more
core +1 more source

