M-SIDH and MD-SIDH: countering SIDH attacks by masking information
The SIDH protocol is an isogeny-based key exchange protocol using supersingular
isogenies, designed by Jao and De Feo in 2011. The protocol underlies the SIKE algorithm …
isogenies, designed by Jao and De Feo in 2011. The protocol underlies the SIKE algorithm …
Efficient algorithms for supersingular isogeny Diffie-Hellman
We propose a new suite of algorithms that significantly improve the performance of
supersingular isogeny Diffie-Hellman (SIDH) key exchange. Subsequently, we present a full …
supersingular isogeny Diffie-Hellman (SIDH) key exchange. Subsequently, we present a full …
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …
[图书][B] Mathematics of public key cryptography
SD Galbraith - 2012 - books.google.com
Public key cryptography is a major interdisciplinary subject with many real-world
applications, such as digital signatures. A strong background in the mathematics underlying …
applications, such as digital signatures. A strong background in the mathematics underlying …
Supersingular isogeny graphs and endomorphism rings: reductions and solutions
K Eisenträger, S Hallgren, K Lauter, T Morrison… - Advances in Cryptology …, 2018 - Springer
In this paper, we study several related computational problems for supersingular elliptic
curves, their isogeny graphs, and their endomorphism rings. We prove reductions between …
curves, their isogeny graphs, and their endomorphism rings. We prove reductions between …
Key compression for isogeny-based cryptosystems
We present a method for key compression in quantumresistant isogeny-based
cryptosystems, which allows a reduction in and transmission costs of per-party public …
cryptosystems, which allows a reduction in and transmission costs of per-party public …
A quantum algorithm for computing isogenies between supersingular elliptic curves
JF Biasse, D Jao, A Sankar - International Conference on Cryptology in …, 2014 - Springer
In this paper, we describe a quantum algorithm for computing an isogeny between any two
supersingular elliptic curves defined over a given finite field. The complexity of our method is …
supersingular elliptic curves defined over a given finite field. The complexity of our method is …
Failing to hash into supersingular isogeny graphs
J Booher, R Bowden, J Doliskani… - The Computer …, 2024 - academic.oup.com
An important open problem in supersingular isogeny-based cryptography is to produce,
without a trusted authority, concrete examples of 'hard supersingular curves' that is …
without a trusted authority, concrete examples of 'hard supersingular curves' that is …
Computational problems in supersingular elliptic curve isogenies
SD Galbraith, F Vercauteren - Quantum Information Processing, 2018 - Springer
We present an overview of supersingular isogeny cryptography and how it fits into the broad
theme of post-quantum public-key crypto. The paper also gives a brief tutorial of elliptic …
theme of post-quantum public-key crypto. The paper also gives a brief tutorial of elliptic …