A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus

Parker Newton, Silas Richelson. A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. IACR Cryptology ePrint Archive, 2022:727, 2022. [doi]

Abstract

Abstract is missing.