Improved classical cryptanalysis of SIKE in practice

DOI10.1007/978-3-030-45388-6_18MaRDI QIDQ2055705zbMATH OpenOpenAlexFDO

Authors Craig Costello, Patrick Longa, Michael Naehrig, Joost Renes, Fernando Virdia

Publication date 1 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-45388-6_18

zbMATH Keywords

isogeniessupersingular elliptic curvespost-quantum cryptographySIKEparallel collision searchSIDHvan Oorschot-Wiener algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over local fields (11G07) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• On the cost of computing isogenies between supersingular elliptic curves
• Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
• Faster isogenies for post-quantum cryptography: SIKE
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Parallel isogeny path finding with limited memory

Cites work

• scientific article; zbMATH DE number 4006420 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1304118 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• scientific article; zbMATH DE number 3356934 (Why is no real title available?)
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Claw finding algorithms using quantum walk
• Complex multiplication structure of elliptic curves
• Computing isogenies between Montgomery curves using the action of \((0,0)\)
• Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
• Faster algorithms for isogeny problems using torsion point images
• On the cost of computing isogenies between supersingular elliptic curves
• Parallel collision search with cryptanalytic applications
• Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
• Reduced memory meet-in-the-middle attack against the NTRU private key
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Arithmetic of Elliptic Curves
• The Complexity of Finding Cycles in Periodic Functions
• The full cost of cryptanalytic attacks
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(12)

• On the isogeny problem with torsion point information
• Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications
• Low-gate quantum golden collision finding
• Faster isogenies for post-quantum cryptography: SIKE
• Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
• Parallel isogeny path finding with limited memory
• Patient zero \& patient six: zero-value and correlation attacks on CSIDH and SIKE
• Revisiting meet-in-the-middle cryptanalysis of SIDH/SIKE with application to the \$IKEp182 challenge
• The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3
• Low memory attacks on small key CSIDH
• Isogeny problems with level structure
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves

This page was built for publication: Improved classical cryptanalysis of SIKE in practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055705)