Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees

Cites Work

Unnamed Item
Unnamed Item
CSIDH: an efficient post-quantum commutative group action
The Weil pairing, and its efficient calculation
Isogeny-based key compression without pairings
Optimal strategies for CSIDH
Memory optimization techniques for computing discrete logarithms in compressed SIKE
Dual isogenies and their application to public-key compression for isogeny-based cryptography
Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Ramanujan graphs and Hecke operators
Faster Key Compression for Isogeny-Based Cryptosystems
Advances in Cryptology – CRYPTO 2004
Efficient Compression of SIDH Public Keys
Faster computation of isogenies of large prime degree
Séta: Supersingular Encryption from Torsion Attacks
Supersingular curves you can trust
M-SIDH and MD-SIDH: countering SIDH attacks by masking information
An efficient key recovery attack on SIDH
A direct key recovery attack on SIDH
Breaking SIDH in polynomial time
SIDH proof of knowledge
New SIDH countermeasures for a more efficient key exchange
A polynomial time attack on instances of M-SIDH and FESTA
Effective pairings in isogeny-based cryptography

This page was built for publication: Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees