Faster Enumeration-Based Lattice Reduction: Root Hermite Factor $$k^{1/(2k)}$$ Time $$k^{k/8+o(k)}$$
Attributed to:
Lattice-Based Cryptography
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-030-56880-1_7
Publication URI: http://dx.doi.org/10.1007/978-3-030-56880-1_7
Type: Book Chapter
Book Title: Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II (2020)
Page Reference: 186-212