Parallel isogeny path finding with limited memory

DOI10.1007/978-3-031-22912-1_13MaRDI QIDQ6169469zbMATH OpenFDO

Authors Emanuele Bellini, Jorge Chavez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger

Publication date 14 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22912-1_13

zbMATH Keywords

cryptanalysisefficient implementationgolden collision searchGPUisogeniesmeet-in-the-middletime-memory trade-offs

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the cost of computing isogenies between supersingular elliptic curves
• The supersingular isogeny problem in genus 2 and beyond
• Constructing canonical strategies for parallel implementation of isogeny based cryptography
• Algebraic approaches for solving isogeny problems of prime power degrees
• Improved classical cryptanalysis of SIKE in practice

Cites work

• A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
• Accelerating the Delfs-Galbraith algorithm with fast subfield root detection
• Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Cryptographic hash functions from expander graphs
• CSIDH on the surface
• Delay encryption
• Elliptic curves. Number theory and cryptography
• Endomorphisms of Abelian varieties over finite fields
• Faster computation of isogenies of large prime degree
• How to meet ternary LWE keys
• Identification protocols and signature schemes based on supersingular isogeny problems
• Improved classical cryptanalysis of SIKE in practice
• Improved low-memory subset sum and LPN algorithms via multiple collisions
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• 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
• SIDH proof of knowledge
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Verifiable delay functions from supersingular isogenies and pairings

Cited in

(7)

• Constructing canonical strategies for parallel implementation of isogeny based cryptography
• Improved classical cryptanalysis of SIKE in practice
• Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling
• Low memory attacks on small key CSIDH
• Memory-efficient attacks on small LWE keys
• Memory-efficient attacks on small LWE keys
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves

This page was built for publication: Parallel isogeny path finding with limited memory

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