Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
From MaRDI portal
Publication:2835601
DOI10.1007/978-3-662-53018-4_21zbMATH Open1384.94046OpenAlexW2495331295MaRDI QIDQ2835601FDOQ2835601
Authors: Craig Costello, Patrick Longa, Michael Naehrig 
Publication date: 30 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_21
Recommendations
- Optimized Modular Multiplication for Supersingular Isogeny Diffie-Hellman
- Supersingular isogeny Diffie-Hellman authenticated key exchange
- A Faster Software Implementation of the Supersingular Isogeny Diffie-Hellman Key Exchange Protocol
- scientific article; zbMATH DE number 7385900
- On the Security of Supersingular Isogeny Cryptosystems
- Supersingular isogeny-based cryptography: a survey
- scientific article; zbMATH DE number 1839433
- scientific article; zbMATH DE number 176556
- Computational problems in supersingular elliptic curve isogenies
- Supersingular isogeny key exchange for beginners
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Faster explicit formulas for computing pairings over ordinary curves
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- The Arithmetic of Elliptic Curves
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Modular Multiplication Without Trial Division
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Title not available (Why is that?)
- Public Key Cryptography - PKC 2006
- Advances in Elliptic Curve Cryptography
- Title not available (Why is that?)
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Endomorphisms of Abelian varieties over finite fields
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Constructing elliptic curve isogenies in quantum subexponential time
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Identifying supersingular elliptic curves
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Title not available (Why is that?)
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Title not available (Why is that?)
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Computing and Combinatorics
- Constructing supersingular elliptic curves
- Claw finding algorithms using quantum walk
Cited In (72)
- On the security of OSIDH
- Identification protocols and signature schemes based on supersingular isogeny problems
- Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies
- Improved torsion-point attacks on SIDH variants
- Improved supersingularity testing of elliptic curves using Legendre form
- Practical isogeny-based key-exchange with optimal tightness
- Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
- Efficient compression of SIDH public keys
- Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
- Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- How not to create an isogeny-based PAKE
- A faster way to the CSIDH
- A key manipulation attack on some recent isogeny-based key agreement protocols
- Faster isogenies for post-quantum cryptography: SIKE
- Towards practical key exchange from ordinary isogeny graphs
- Efficient post-quantum undeniable signature on 64-bit ARM
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- On fast calculation of addition chains for isogeny-based cryptography
- Benchmarking post-quantum cryptography in TLS
- On the cost of computing isogenies between supersingular elliptic curves
- Supersingular isogeny Diffie-Hellman authenticated key exchange
- Post-quantum static-static key agreement using multiple protocol instances
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- SIKE round 2 speed record on ARM Cortex-M4
- Computational problems in supersingular elliptic curve isogenies
- On the hardness of the computational ring-LWR problem and its applications
- On the statistical leak of the GGH13 multilinear map and some variants
- Improved classical cryptanalysis of SIKE in practice
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- Verifiable delay functions from supersingular isogenies and pairings
- Faster isogeny-based compressed key agreement
- Towards isogeny-based password-authenticated key establishment
- Optimized arithmetic operations for isogeny-based cryptography on Huff curves
- On the Security of Supersingular Isogeny Cryptosystems
- A new adaptive attack on SIDH
- An efficient post-quantum KEM from CSIDH
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Title not available (Why is that?)
- An exposure model for supersingular isogeny Diffie-Hellman key exchange
- The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3
- Optimizing the evaluation of \(\ell\)-isogenous curve for isogeny-based cryptography
- Delay encryption
- Group key exchange protocols from supersingular isogenies
- Efficient finite field multiplication for isogeny based post quantum cryptography
- Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman
- An alternative approach for SIDH arithmetic
- Isogeny-based key compression without pairings
- Simplified isogeny formulas on twisted Jacobi quartic curves
- Resistance of isogeny-based cryptographic implementations to a fault attack
- The security of all private-key bits in isogeny-based schemes
- Post-quantum key exchange for the Internet and the open quantum safe project
- Optimal strategies for CSIDH
- Computing supersingular isogenies on Kummer surfaces
- Full key recovery side-channel attack against ephemeral SIKE on the cortex-M4
- CSIDH: an efficient post-quantum commutative group action
- Eliptic curves in post-quantum cryptography
- On lions and elligators: an efficient constant-time implementation of CSIDH
- Many a mickle makes a muckle: a framework for provably quantum-secure hybrid key exchange
- Optimized Modular Multiplication for Supersingular Isogeny Diffie-Hellman
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- Faster cryptographic hash function from supersingular isogeny graphs
- 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
- Efficient isogeny proofs using generic techniques
- Efficiency of SIDH-based signatures (yes, SIDH)
- Multidimensional quantum walks
- Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling
- EdSIDH: supersingular isogeny Diffie-Hellman key exchange on Edwards curves
- New SIDH countermeasures for a more efficient key exchange
- Effective pairings in isogeny-based cryptography
- Breaking SIDH in polynomial time
Uses Software
This page was built for publication: Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835601)
