Efficient Algorithms for Supersingular Isogeny Diffie-Hellman

DOI10.1007/978-3-662-53018-4_21zbMath1384.94046OpenAlexW2495331295MaRDI QIDQ2835601

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

zbMATH Keywords

isogeniessupersingular elliptic curvespost-quantum cryptographyDiffie-Hellman key exchangeSIDH

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (42)

A key manipulation attack on some recent isogeny-based key agreement protocols ⋮ Many a Mickle Makes a Muckle: A Framework for Provably Quantum-Secure Hybrid Key Exchange ⋮ The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3 ⋮ Improved supersingularity testing of elliptic curves using Legendre form ⋮ On the hardness of the computational ring-LWR problem and its applications ⋮ On the statistical leak of the GGH13 multilinear map and some variants ⋮ Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA ⋮ Full key recovery side-channel attack against ephemeral SIKE on the cortex-M4 ⋮ Resistance of isogeny-based cryptographic implementations to a fault attack ⋮ Faster isogenies for post-quantum cryptography: SIKE ⋮ A new adaptive attack on SIDH ⋮ An efficient post-quantum KEM from CSIDH ⋮ Optimizing the evaluation of \(\ell\)-isogenous curve for isogeny-based cryptography ⋮ The security of all private-key bits in isogeny-based schemes ⋮ Breaking SIDH in polynomial time ⋮ Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling ⋮ On the Security of Supersingular Isogeny Cryptosystems ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ Efficiency of SIDH-based signatures (yes, SIDH) ⋮ B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion ⋮ CSIDH: an efficient post-quantum commutative group action ⋮ Computing supersingular isogenies on Kummer surfaces ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ On the cost of computing isogenies between supersingular elliptic curves ⋮ SIKE Round 2 Speed Record on ARM Cortex-M4 ⋮ How not to create an isogeny-based PAKE ⋮ Post-quantum static-static key agreement using multiple protocol instances ⋮ Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman ⋮ HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption ⋮ Efficient post-quantum undeniable signature on 64-bit ARM ⋮ Computational problems in supersingular elliptic curve isogenies ⋮ Efficient Compression of SIDH Public Keys ⋮ Towards isogeny-based password-authenticated key establishment ⋮ Identification protocols and signature schemes based on supersingular isogeny problems ⋮ Delay encryption ⋮ Group key exchange protocols from supersingular isogenies ⋮ An alternative approach for SIDH arithmetic ⋮ Isogeny-based key compression without pairings ⋮ Simplified isogeny formulas on twisted Jacobi quartic curves ⋮ Eliptic curves in post-quantum cryptography ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies

Uses Software

• McEliece
• NTRU
• SIDH
• Curve25519
• Ed448-Goldilocks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved algorithm for the isogeny problem for ordinary elliptic curves
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Claw finding algorithms using quantum walk
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Endomorphisms of Abelian varieties over finite fields
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Modular Multiplication Without Trial Division
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• The Arithmetic of Elliptic Curves
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Identifying supersingular elliptic curves
• Constructing elliptic curve isogenies in quantum subexponential time
• Advances in Elliptic Curve Cryptography
• Topics in Cryptology – CT-RSA 2005
• Computing and Combinatorics
• Public Key Cryptography - PKC 2006
• Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)

This page was built for publication: Efficient Algorithms for Supersingular Isogeny Diffie-Hellman