Memory-efficient attacks on small LWE keys

Cites Work

Unnamed Item
Ternary Syndrome Decoding with large weight
Parallel collision search with cryptanalytic applications
Implementing Joux-Vitse's crossbred algorithm for solving $\mathcal M\mathcal Q$ systems over $\mathbb F_2$ on GPUs
On the cost of computing isogenies between supersingular elliptic curves
NTRU prime: reducing attack surface at low cost
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
Low weight discrete logarithm and subset sum in $2^{0.65n}$ with polynomial memory
Advanced lattice sieving on GPUs, with tensor cores
Faster enumeration-based lattice reduction: root Hermite factor $k^{1/(2k)}$ time $k^{k/8+o(k)}$
How to meet ternary LWE keys
McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
Improved low-memory subset sum and LPN algorithms via multiple collisions
Improved classical and quantum algorithms for subset-sum
Memory-Efficient Algorithms for Finding Needles in Haystacks
A Subfield Lattice Attack on Overstretched NTRU Assumptions
Lattice Signatures and Bimodal Gaussians
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Lattice Signatures without Trapdoors
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
Reduced memory meet-in-the-middle attack against the NTRU private key
Improved Generic Algorithms for Hard Knapsacks
Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
On Ideal Lattices and Learning with Errors over Rings
New Generic Algorithms for Hard Knapsacks
Lattice Enumeration Using Extreme Pruning
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
Efficient Public Key Encryption Based on Ideal Lattices
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
High-Speed Key Encapsulation from NTRU
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
New time-memory trade-offs for subset sum -- improving ISD in theory and practice
Hybrid dual and meet-LWE attack
Parallel isogeny path finding with limited memory
Memory-efficient attacks on small LWE keys

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