Faster isogenies for post-quantum cryptography: SIKE
From MaRDI portal
Publication:2152149
DOI10.1007/978-3-030-95312-6_3zbMATH Open1492.94097OpenAlexW4210362437MaRDI QIDQ2152149FDOQ2152149
- SIKE round 2 speed record on ARM Cortex-M4
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- An alternative approach for SIDH arithmetic
- Dual isogenies and their application to public-key compression for isogeny-based cryptography
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
Cites Work
- scientific article; zbMATH DE number 7385899 (Why is no real title available?)
- scientific article; zbMATH DE number 7385900 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A Faster Software Implementation of the Supersingular Isogeny Diffie-Hellman Key Exchange Protocol
- A High-Performance and Scalable Hardware Architecture for Isogeny-Based Cryptography
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- An exposure model for supersingular isogeny Diffie-Hellman key exchange
- CSIDH: an efficient post-quantum commutative group action
- Constructing elliptic curve isogenies in quantum subexponential time
- Cryptographic hash functions from expander graphs
- Dual isogenies and their application to public-key compression for isogeny-based cryptography
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Efficient compression of SIDH public keys
- Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
- Fault attack on supersingular isogeny cryptosystems
- How not to create an isogeny-based PAKE
- Identification protocols and signature schemes based on supersingular isogeny problems
- Improved classical cryptanalysis of SIKE in practice
- Isogeny-based key compression without pairings
- Loop-abort faults on supersingular isogeny cryptosystems
- On the Security of Supersingular Isogeny Cryptosystems
- On the cost of computing isogenies between supersingular elliptic curves
- Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman
- Supersingular Isogeny Key Encapsulation (SIKE) Round 2 on ARM Cortex-M4
- The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3
- Towards isogeny-based password-authenticated key establishment
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited In (12)
- Improvement of the square-root Vélu's formulas for isogeny-based cryptography
- The superlinearity problem in post-quantum blockchains
- Constructing canonical strategies for parallel implementation of isogeny based cryptography
- Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
- Memory optimization techniques for computing discrete logarithms in compressed SIKE
- DeCSIDH: delegating isogeny computations in the CSIDH setting
- SIKE round 2 speed record on ARM Cortex-M4
- Improved classical cryptanalysis of SIKE in practice
- Title not available (Why is no real title available?)
- An alternative approach for SIDH arithmetic
- Dual isogenies and their application to public-key compression for isogeny-based cryptography
- Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling
This page was built for publication: Faster isogenies for post-quantum cryptography: SIKE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152149)
