Parker Newton, Silas Richelson. A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. In Helena Handschuh, Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part V. Volume 14085 of Lecture Notes in Computer Science, pages 805-835, Springer, 2022. [doi]
Abstract is missing.