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

Parker Newton, Silas Richelson

Browse the full CRYPTO paper archive.