Too many hints -- when LLL breaks LWE
From MaRDI portal
Publication:6604869
DOI10.1007/978-981-99-8730-6_4zbMATH Open1547.94391MaRDI QIDQ6604869FDOQ6604869
Authors: Alexander May, Julian Nowakowski 
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- (Leveled) fully homomorphic encryption without bootstrapping
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Efficient public key encryption based on ideal lattices (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- Worst-case to average-case reductions for module lattices
- Natural density of rectangular unimodular integer matrices
- Title not available (Why is that?)
- Lattice reduction: a toolbox for the cryptoanalyst
- An Improved Low-Density Subset Sum Algorithm
- LWE with side information: attacks and concrete security estimation
- Pseudorandomness of ring-LWE for any ring and modulus
- Lattice Attacks on NTRU and LWE: A History of Refinements
- Partial key exposure attacks on BIKE, Rainbow and NTRU
This page was built for publication: Too many hints -- when LLL breaks LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604869)
