Low memory attacks on small key CSIDH

DOI10.1007/978-3-031-33491-7_11MaRDI QIDQ6535121zbMATH OpenFDO

Authors Jesús-Javier Chi-Domínguez, Andre Esser, Sabrina Kunzweiler, Alexander May

Publication date 10 November 2023

zbMATH Keywords

isogenyrepresentation techniquetime-memory trade-off

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Quantum cryptography (quantum-theoretic aspects) (81P94) Elliptic curves (14H52)

Recommendations

• He gives C-sieves on the CSIDH
• \( L_1\)-norm ball for CSIDH: optimal strategy for choosing the secret key space
• An efficient key recovery attack on SIDH
• A trade-off between classical and quantum circuit size for an attack against CSIDH

Cites work

• scientific article; zbMATH DE number 2086697 (Why is no real title available?)
• A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• CSIDH: an efficient post-quantum commutative group action
• Claw finding algorithms using quantum walk
• Cryptographic group actions and applications
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding linear codes with high error rate and its impact for LPN security
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
• He gives C-sieves on the CSIDH
• How to meet ternary LWE keys
• Improved classical and quantum algorithms for subset-sum
• Improved classical cryptanalysis of SIKE in practice
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
• Memory-efficient attacks on small LWE keys
• New directions in nearest neighbor searching with applications to lattice sieving
• On computing nearest neighbors with applications to decoding of binary linear codes
• On lions and elligators: an efficient constant-time implementation of CSIDH
• On the cost of computing isogenies between supersingular elliptic curves
• Optimal strategies for CSIDH
• Parallel collision search with cryptanalytic applications
• Parallel isogeny path finding with limited memory
• Quantum key search for ternary LWE
• Quantum security analysis of CSIDH
• Stronger and faster side-channel protections for CSIDH
• Ternary Syndrome Decoding with large weight
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(2)

• Fast and Frobenius: rational isogeny evaluation over finite fields
• Low-memory attacks against two-round Even-Mansour using the 3-XOR problem

This page was built for publication: Low memory attacks on small key CSIDH

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