Subfield attacks on HSVP in ideal lattices
From MaRDI portal
Publication:6134036
Recommendations
Cites work
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- A decade of lattice cryptography
- A hierarchy of polynomial time lattice basis reduction algorithms
- Efficient public key encryption based on ideal lattices (extended abstract)
- Factoring polynomials with rational coefficients
- Finding short lattice vectors within Mordell's inequality
- Number fields
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the ideal shortest vector problem over random rational primes
- Practical, Predictable Lattice Basis Reduction
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Rankin’s Constant and Blockwise Lattice Reduction
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Trapdoors for hard lattices and new cryptographic constructions
This page was built for publication: Subfield attacks on HSVP in ideal lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134036)