Subfield attacks on HSVP in ideal lattices
From MaRDI portal
Publication:6134036
DOI10.1007/978-3-031-26553-2_24zbMATH Open1519.94107MaRDI QIDQ6134036FDOQ6134036
Kun Peng Wang, Zhili Dong, Chang Lv, Shixin Tian
Publication date: 21 August 2023
Published in: Information Security and Cryptology (Search for Journal in Brave)
Recommendations
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
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Factoring polynomials with rational coefficients
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient public key encryption based on ideal lattices (extended abstract)
- Title not available (Why is that?)
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- Number fields
- Finding short lattice vectors within Mordell's inequality
- Practical, Predictable Lattice Basis Reduction
- A decade of lattice cryptography
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Pseudorandomness of ring-LWE for any ring and modulus
- Rankin’s Constant and Blockwise Lattice Reduction
- On the ideal shortest vector problem over random rational primes
- Slide reduction, revisited -- filling the gaps in SVP approximation
Cited In (1)
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)
