Improved classical cryptanalysis of SIKE in practice
DOI10.1007/978-3-030-45388-6_18zbMATH Open1481.94093OpenAlexW3022587607MaRDI QIDQ2055705FDOQ2055705
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
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
isogeniessupersingular elliptic curvespost-quantum cryptographySIKEparallel collision searchSIDHvan Oorschot-Wiener algorithm
Cryptography (94A60) Elliptic curves over local fields (11G07) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- The Arithmetic of Elliptic Curves
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel collision search with cryptanalytic applications
- Title not available (Why is that?)
- The Complexity of Finding Cycles in Periodic Functions
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Complex multiplication structure of elliptic curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- On the cost of computing isogenies between supersingular elliptic curves
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Title not available (Why is that?)
- Claw finding algorithms using quantum walk
- Computing isogenies between Montgomery curves using the action of \((0,0)\)
- Faster algorithms for isogeny problems using torsion point images
- Reduced memory meet-in-the-middle attack against the NTRU private key
- The full cost of cryptanalytic attacks
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)