Memory-efficient attacks on small LWE keys

DOI10.1007/978-981-99-8730-6_3zbMATH Open1547.9436MaRDI QIDQ6604868FDOQ6604868

Authors: Andre Esser, Rahul Girme, Arindam Mukherjee, Santanu Sarkar 

Publication date: 13 September 2024

Recommendations

• Memory-efficient attacks on small LWE keys
• How to meet ternary LWE keys
• How to enumerate LWE keys as narrow as in \textsc{Kyber}/\textsc{Dilithium}
• Quantum key search for ternary LWE
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS

zbMATH Keywords

learning with errorsrepresentation techniquenested collision searchpolynomial memory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Title not available (Why is that?)
• On ideal lattices and learning with errors over rings
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• On lattices, learning with errors, random linear codes, and cryptography
• Efficient public key encryption based on ideal lattices (extended abstract)
• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
• Lattice signatures without trapdoors
• Parallel collision search with cryptanalytic applications
• Lattice signatures and bimodal Gaussians
• Improved Generic Algorithms for Hard Knapsacks
• Lattice enumeration using extreme pruning
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• New generic algorithms for hard knapsacks
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• Ternary Syndrome Decoding with large weight
• Advanced lattice sieving on GPUs, with tensor cores
• On the cost of computing isogenies between supersingular elliptic curves
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Implementing Joux-Vitse's crossbred algorithm for solving \(\mathcal M\mathcal Q\) systems over \(\mathbb F_2\) on GPUs
• NTRU prime: reducing attack surface at low cost
• Reduced memory meet-in-the-middle attack against the NTRU private key
• High-speed key encapsulation from NTRU
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
• Improved low-memory subset sum and LPN algorithms via multiple collisions
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• Improved classical and quantum algorithms for subset-sum
• How to meet ternary LWE keys
• McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
• Hybrid dual and meet-LWE attack
• New time-memory trade-offs for subset sum -- improving ISD in theory and practice
• Parallel isogeny path finding with limited memory

Cited In (3)

• Memory-efficient attacks on small LWE keys
• Low memory attacks on small key CSIDH
• How to enumerate LWE keys as narrow as in \textsc{Kyber}/\textsc{Dilithium}

This page was built for publication: Memory-efficient attacks on small LWE keys

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